Transmit pre-coding

ABSTRACT

A method for receiving an Orthogonal Frequency Division Multiplexing (OFDM) signal transmitted by a user device in a wireless network comprises determining which subcarrier frequencies are allocated to the user device; converting the OFDM signal to a frequency-domain values corresponding to the subcarrier frequencies; and decoding the frequency-domain values to recover data symbols encoded by the user device on the subcarrier frequencies. The decoding employs codes that are inverse to, complex-conjugate of, or complementary to a set of complex-valued codes employed by the user device to shape the OFDM signal into a superposition of cyclic-shifted pulse waveforms, wherein each of the pulse waveforms has one of the data symbols modulated thereon.

RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.14/727,769, filed Jun. 1, 2015, which is a Continuation of U.S. patentapplication Ser. No. 14/276,309, filed May 13, 2014, now U.S. Pat. No.9,048,897, which is a Continuation of U.S. patent application Ser. No.12/545,572, filed Aug. 21, 2009, now U.S. Pat. No. 8,750,264, which is aDivisional of U.S. patent application Ser. No. 11/187,107, filed on Jul.22, 2005, now U.S. Pat. No. 8,670,390, which claims priority toProvisional Appl. No. 60/598,187, filed Aug. 2, 2004, all of which areincorporated by reference in their entireties.

BACKGROUND I. Field

Disclosed aspects relate generally to antenna-array processing andad-hoc networking, and particularly to providing cooperative signalprocessing between a plurality of wireless terminal devices, such as toimprove network access.

II. Background

Wireless data service is an emerging market with high growth potential.However, market growth requires higher bandwidth and better coveragethan cellular technologies can provide. Furthermore, state-of-the-artwireless network technologies are mainly focused on the server side,rather than using mobile wireless terminals to extend the networkinfrastructure.

A peer-to-peer mode of communication is expected to offer distinctperformance benefits over the conventional cellular model, includingbetter spatial-reuse characteristics, lower energy consumption, andextended coverage areas. The key advantage of the peer-to-peer networkmodel is the increase in spatial reuse due to its short-rangetransmissions. Although peer-to-peer networking shows some promise,there are significant drawbacks that prevent conventional peer-to-peernetworks from being a technically and commercially viable solution.

Recent analyses of multi-hop networks compared to cellular networks haveindicated that the spatial reuse improvement in the peer-to-peer networkmodel does not translate into greater throughput. Rather, the throughputis lower than that observed in the cellular network model. Thisobservation is explained in three parts:

-   -   Multi-hop Routes: Although the spatial reuse is increased, since        a flow traverses multiple hops in the peer-to-peer network        model, the end-to-end throughput of a flow, while directly        proportional to the spatial reuse, is also inversely        proportional to the hop-length. Moreover, since the expected        hop-length in a dense network is of the order of O(√n), a        tighter bound on the expected per-flow throughput is O(1/√n).        While this bound is still higher than that of the dense cellular        network model (O(1/n)), the following two reasons degrade the        performance even more.    -   Base-Station Bottleneck: The degree of spatial reuse and        expected per-flow throughput of the peer-to-peer network model        is valid for a network where all flows have destinations within        the same cell. In this case, the base station is the destination        for all flows (e.g., it is the destination of the wireless        path). Thus, any increase in spatial reuse cannot be fully        realized as the channel around the base-station becomes a        bottleneck and has to be shared by all the flows in the network.        Note that this is not an artifact of the single-channel model.        As long as the resources around the base-station are shared by        all the flows in the network (irrespective of the number of        channels), the performance of the flows will be limited to that        of the cellular network model.    -   Protocol Inefficiencies: The protocols used in the cellular        network model are both simple and centralized, with the base        station performing most of the coordination. Cellular protocols        operate over a single hop, leading to very minimal performance        degradation because of protocol inefficiencies. However, in the        peer-to-peer network model, the protocols (such as IEEE 802.11        and DSR) are distributed, and they operate over multiple hops.        The multi-hop path results in more variation in latency, losses,        and throughput for TCP. These inefficiencies (which arise        because of the distributed operation of the medium access and        routing layers) and the multi-hop operation at the transport        layer translate into a further degraded performance.

Similarly, antenna-array processing has demonstrated impressiveimprovements in coverage and spatial reuse. Array-processing systemstypically employ multiple antennas at base stations to focus transmittedand received radio energy and thereby improve signal quality. Incellular communications, improvements in signal quality lead tosystem-wide benefits with respect to coverage, service quality and,ultimately, the economics of cellular service. Furthermore, theimplementation of antenna arrays at both ends of a communication linkcan greatly increase the capacity and performance benefits via MultipleInput Multiple Output (MIMO) processing. However, power, cost, and sizeconstraints typically make the implementation of antenna arrays onmobile wireless terminals, such as handsets or PDAs, impractical.

In cooperative diversity, each wireless terminal is assigned anorthogonal signal space relative to the other terminals for transmissionand/or reception. In particular, both multiplexing and multiple accessin cooperative diversity are orthogonal. In antenna-array processing,either or both multiplexing and multiple access are non-orthogonal.Specifically, some form of interference cancellation is required toseparate signals in an array-processing system because transmittedand/or received information occupies the same signal space.

Applications and embodiments relate to ad-hoc networking andantenna-array processing. Embodiments may address general and/orspecific needs that are not adequately serviced by the prior art,including (but not limited to) improving network access (e.g., enhancingrange, coverage, throughput, connectivity, and/or reliability).Applications of certain embodiments may include tactical, emergencyresponse, and consumer wireless communications. Due to the breadth andscope of the present invention, embodiments may be provided forachieving a large number of objectives and applications, which are toonumerous to list herein. Therefore, only some of the objects andadvantages of specific embodiments are discussed in the Summary and inthe Detailed Description.

SUMMARY

Some of the exemplary embodiments of the disclosure are summarized asfollows. Embodiments include beam-forming systems configured to enablespatially separated wireless terminals (WTs) to perform beam-formingoperations in a wireless wide area network (WWAN). A wireless local areanetwork (WLAN) couples together the WTs, which may be configured toshare WWAN data, access, and control information. A beam-forming systemmay comprise the WTs, which function as elements of an antenna array.WWAN network access functions (such as monitoring control channels andexchanging control messages with the WWAN) may be provided in acentralized or a distributed manner with respect to the WTs.

Embodiments also include systems and methods configured for allocatingnetwork resources among the WTs, load balancing, distributed computing,antenna-switching diversity, WWAN diversity, interference mitigation,hand off, power control, authentication, session management, ad-hocnetwork control, error correction coding, and interference mitigation.Other embodiments and variations thereof are described in the DetailedDescription.

In one embodiment, a computer program comprises a beam-forming weightcalculation source code segment adapted to calculate at least one set ofbeam-forming weights for signaling between at least one group of WTs andat least one WWAN, and a WLAN information-distribution source codesegment adapted to distribute at least one of a set of signals betweenthe at least one group of WTs, the set of signals including a pluralityof received WWAN signals, a plurality of WWAN transmission data, and theat least one set of beam-forming weights.

In another embodiment, a computer program comprises a beam-formingweight source code segment adapted to calculate at least one set ofbeam-forming weights for signaling between at least one group of WTs andat least one WWAN, and a MIMO combining source code segment adapted tocombine a plurality of weighted received WWAN signals, at least one ofthe beam-forming weight source code segment and the MIMO combiningsource code segment including WLAN information-distribution source codeadapted to distribute at least one of a set of signals between the atleast one group of wireless terminals, the set of signals including aplurality of received WWAN signals, a plurality of WWAN transmissiondata, at least one channel estimate, and the at least one set ofbeam-forming weights.

A receiver embodiment of the invention comprises a plurality of WWANinterfaces, wherein each WWAN interface is adapted to receive at leastone transmitted WWAN signal; a plurality of baseband processors whereineach baseband processor is coupled to at least one WWAN interface in theplurality of WWAN interfaces, the plurality of baseband processorsadapted to generate a plurality of WWAN baseband signals; at least oneWLAN coupled to the plurality of baseband processors; and at least oneMIMO combiner adapted to receive at least one WWAN baseband signal fromthe WLAN, the at least one MIMO combiner adapted to perform MIMOcombining of a plurality of WWAN baseband signals.

A transmitter embodiment of the invention comprises a plurality of WWANinterfaces wherein each WWAN interface is adapted to transmit at leastone WWAN signal; at least one data source adapted to generate at leastone data signal for transmission into at least one WWAN; at least oneWLAN adapted to couple the at least one data signal to the plurality ofWWAN interfaces for generating a plurality of WWAN data signals; and atleast one MIMO processor adapted to generate a plurality of complexweights for weighting the plurality of WWAN data signals.

A wireless terminal according to one aspect of the invention comprisesat least one WWAN interface; at least one WLAN interface; and at leastone cooperative beam-forming system coupled between the WWAN interfaceand the WLAN interface and adapted to perform beamforming withinformation received from the WLAN interface.

Receivers and cancellation systems described herein may be employed insubscriber-side devices (e.g., cellular handsets, wireless modems, andconsumer premises equipment) and/or server-side devices (e.g., cellularbase stations, wireless access points, wireless routers, wirelessrelays, and repeaters). Chipsets for subscriber-side and/or server-sidedevices may be configured to perform at least some of the receiverand/or cancellation functionality of the embodiments described herein.

Additional embodiments, objects, and advantages are described andinferred from the following detailed descriptions and figures. Althoughparticular embodiments are described herein, many variations andpermutations of these embodiments fall within the scope and spirit ofthe invention. Although some benefits and advantages of the preferredembodiments are mentioned, the scope of the invention is not intended tobe limited to particular benefits, uses, or objectives. Rather,embodiments of the invention are intended to be broadly applicable todifferent wireless technologies, system configurations, networks, andtransmission protocols, some of which are illustrated by way of examplein the figures and in the following detailed description. The detaileddescription and drawings are merely illustrative of the invention ratherthan limiting, the scope of the invention being defined by the appendedclaims and equivalents thereof.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A illustrates an application of various embodiments of theinvention to a cellular network.

FIG. 1B illustrates an embodiment of the invention in which transmittedand/or received data between a WLAN group and a WWAN terminal occupiesparallel, redundant channels c_(n).

FIG. 1C illustrates an embodiment of the invention in which a WLAN groupcomprising a plurality of Wireless Terminals (WTs) is adapted tocommunicate with at least one WWAN node.

FIG. 1D illustrates an embodiment of the invention in whichcommunications between a WWAN node and a plurality of WTs arecharacterized by different, yet complementary, code spaces c₁, c₂, andc₃.

FIG. 1E illustrates an embodiment of the invention in which a first WLANgroup is adapted to communicate with a second WLAN group via at leastone WWAN channel or network.

FIG. 1F shows an embodiment of the invention wherein a WLAN groupincludes a plurality of WWAN-active WTs and at least one WWAN-inactiveWT.

FIG. 1G illustrates a cooperative beam-forming embodiment of theinvention that functions in the presence of a desired WWAN terminal anda jamming source.

FIG. 1H illustrates a cooperative beam-forming embodiment of theinvention that functions in the presence of a plurality of desired WWANterminals.

FIG. 1I illustrates an embodiment of the invention adapted to provide aplurality of WTs in a WLAN group with access to a plurality of WWANservices.

FIG. 1J illustrates an embodiment of the invention in which a WLAN groupincludes at least one WWAN terminal.

FIG. 2A illustrates a functional receiver embodiment of the inventionthat may be realized in both method and apparatus embodiments.

FIG. 2B illustrates a functional receiver embodiment of the inventionthat may be realized in both method and apparatus embodiments.

FIG. 3A illustrates an embodiment of the invention in which a WLANcontroller for a WLAN group allocates processing resources based onWWAN-link performance.

FIG. 3B illustrates an alternative embodiment of the invention in whicha WLAN controller for a WLAN group allocates processing resources basedon WWAN-link performance.

FIG. 4A illustrates a MIMO receiver embodiment of the invention.

FIG. 4B illustrates a functional embodiment of the invention in whichMIMO processing operations are distributed over two or more WTs.

FIG. 4C illustrates a functional embodiment of the invention fortransmission and reception of WWAN signals in a distributed network ofWTs.

FIG. 4D illustrates a functional embodiment of the invention adapted toperform cooperative beamforming.

FIG. 5A illustrates a receiver embodiment of the invention that may beimplemented by hardware and/or software.

FIG. 5B illustrates an alternative receiver embodiment of the invention.

FIG. 6A illustrates functional and apparatus embodiments of the presentinvention pertaining to one or more WTs coupled to at least one WWAN andat least one WLAN.

FIG. 6B illustrates a preferred embodiment of the invention that may beemployed as either or both apparatus and functional embodiments of oneor more WTs.

FIG. 7A illustrates a functional embodiment of the invention related tocalculating MIMO weights in a cooperative-beamforming network.

FIG. 7B illustrates a functional embodiment of the invention adapted tocalculate transmitted data symbols received by a cooperative-beamformingnetwork.

FIG. 8A illustrates a preferred transmitter embodiment of the invention.

FIG. 8B illustrates a preferred receiver embodiment of the invention.

FIG. 8C illustrates an embodiment of the invention in which a pluralityof WTs is adapted to perform time-domain processing.

FIG. 9A illustrates an optional transmission embodiment of the presentinvention.

FIG. 9B illustrates a functional flow chart that pertains to transmitterapparatus and method embodiments of the invention.

FIG. 10A illustrates software components of a transmission embodiment ofthe invention residing on a computer-readable memory.

FIG. 10B illustrates software components of a receiver embodiment of theinvention residing on a computer-readable memory.

FIG. 11 shows a WWAN comprising a WWAN access point (e.g., a basestation) and a local group comprising a plurality of wireless terminalscommunicatively coupled together via a WLAN. A network-managementoperator is configured to handle WWAN-control operations within thelocal group.

FIG. 12 is a block diagram of a communication system comprising a WLANfor communicatively coupling a plurality of mobile wireless terminals toa WLAN controller, and a network-management operator for cooperativelyprocessing WWAN-control messages for the mobile wireless terminals.

FIG. 13 is a block diagram of a mobile wireless terminal in accordancewith an aspect of the invention in which a WWAN network managementoperator module is communicatively coupled to at least one other mobilewireless terminal via a WLAN and communicatively coupled to the WWAN.

FIG. 14 illustrates a method in accordance with an aspect of theinvention in which WWAN communications for a group of wireless terminalsare cooperatively processed.

FIG. 15 is a plot of a plurality of CI carriers and a superposition ofthe carriers.

FIG. 16A is a plot of the relative frequency-versus-amplitude profile ofa plurality of CI carriers that are combined to produce a time-domainpulse train, such as a DS-CDMA chip sequence.

FIG. 16B is a time-domain representation of a modulated pulse trainproduced by providing time offsets to a plurality of modulated pulses,or equivalently, from a superposition of the CI carriers represented inFIG. 2A.

FIG. 17A illustrates a plurality of CI pulse waveforms modulated withcode and/or information symbols .beta..sub.n and positioned orthogonallyin time.

FIG. 17B illustrates a CI pulse train of orthogonally time-offsetpulses.

FIG. 18A illustrates CI signal generation.

FIG. 18B illustrates a CI transmitter.

FIGS. 19 and 20 each illustrates a system and method of generating CIsignals.

FIG. 21 illustrates basic components of CI signal generation softwareresiding on a computer-readable medium.

FIG. 22A is a time-domain plot of a plurality of pulses generated from asuperposition of equally spaced carriers, and shows a set of carrierphases corresponding to each of the pulses.

FIG. 22B represents basic components and characteristics of a CIwaveform.

FIG. 23A is a functional flow chart of a CI receiver.

FIG. 23B illustrates a CI receiver method and apparatus including aphase-space decoder.

FIG. 24A shows an embodiment of a CI receiver.

FIG. 24B shows an alternative embodiment of a CI receiver.

FIG. 25A illustrates an aspect of a CI reception method and apparatus.

FIG. 25B illustrates a CI receiver method and system of the presentinvention.

FIG. 26A illustrates a CI receiver apparatus and method of theinvention.

FIG. 26B is a flow diagram for a receiver that receives a CI signal andsamples the signal in multiple phase spaces.

FIG. 26C illustrates basic components of a computer program on acomputer-readable medium adapted to control a receiver and optimizeperformance.

FIG. 27A illustrates a CI receiver configured as a multi-elementreceiver. Such receiver configurations may be employed inmultiple-input, multiple-output (MIMO) communications.

FIG. 27B illustrates three pulse-waveform blocks wherein each blockincludes four pulse waveforms of duration T.sub.s.

FIG. 28A illustrates a CI transmitter.

FIG. 28B illustrates a CI reception method and apparatus.

FIG. 28C shows a CI receiver adapted to project a received signal ontoat least one orthonormal basis, such as an orthonormal basiscorresponding to at least one transmitted signal.

FIG. 29A illustrates a block waveform including a set of orthogonal CIpulse waveforms.

FIG. 29B illustrates a method for generating sub-carrier weights from aset of data symbols and a CI code matrix.

FIG. 30A illustrates a transmitter apparatus and method configured togenerate multiple transmission waveforms.

FIG. 30B shows a receiver apparatus and method adapted to process a widerange of single-carrier and/or multi-carrier transmissions.

FIG. 31A illustrates a communication method.

FIG. 31B shows CI processing of received single-carrier and/ormulti-carrier signals.

FIG. 32 illustrates a sub-space/sub-carrier processor receiver.

FIG. 33A illustrates basic components of CI signal generation softwareresiding on a computer-readable medium.

FIG. 33B illustrates basic components of CI receiver software residingon a computer-readable medium.

DETAILED DESCRIPTION

While the invention is susceptible to various modifications andalternative forms, specific embodiments thereof are shown by way ofexample in the drawings and are herein described in detail. It should beunderstood, however, that the exemplary embodiments are not intended tolimit the invention to the particular forms disclosed. Instead, theinvention is to cover all modifications, equivalents, and alternativesfalling within the spirit and scope of the invention as defined by theclaims.

FIG. 1A illustrates how some embodiments of the invention may beemployed in a cellular network. Each wireless terminal (WT) of aplurality of WTs 101-103 is in radio contact with at least one wirelesswide area network (WWAN) terminal, which may also be referred to as aWWAN node, such as cellular base station 119. The cellular base station119 may include one or more antennas (e.g., an antenna array). WWANsignals transmitted between the base station 119 and the WTs 101-103propagate through a WWAN channel 99, which is typically characterized byAWGN, multipath effects, and may include external interference.

The WTs 101-103 represent a wireless local area network (WLAN) group 110(or local group) if they are currently connected or are capable of beingconnected via a WLAN 109. Accordingly, the WTs may be adapted to connectto at least one WWAN and to at least one WLAN. The WLAN group 110 mayconsist of two or more WTs in close enough proximity to each other tomaintain WLAN communications. A given WWAN may include one or more WLANgroups, such as WLAN group 110.

In an exemplary embodiment of the present invention, the WTs 101-103 maybe configured to transmit data d_(t)(n) over a WWAN channel to the basestation 119. The WTs 101-103 may also be configured to receive datad_(r)(n) on a WWAN channel from the base station 119. The received datad_(r)(n) is shared by the WTs 101-103 via the WLAN 109. Similarly, thetransmitted data d_(t)(n) may be distributed to the WTs 101-103 via theWLAN 109. The WLAN 109 typically comprises the wireless-communicationresource between the WTs 101-103 and the associated physical-layerinterface hardware. The WLAN 109 is differentiated from a WWAN by itsrelatively shorter range. For example, a Bluetooth or UWB systemfunctioning within an IEEE 802.11 network would be referred to as aWLAN, whereas the 802.11 network would be referred to as a WWAN. A WLANmay operate in a different frequency band than the WWAN. Alternatively,other orthogonalizing techniques may be employed for separating WLAN andWWAN signals from each other. WLANs and WWANs, as defined herein, mayemploy any type of free-space transmissions, including, but not limitedto, ultra-low frequency, RF, microwave, infrared, optical, and acoustictransmissions. WLANs and WWANs may employ any type of transmissionmodality, including, but not limited to, wideband, UWB, spread-spectrum,multi-band, narrowband, or dynamic-spectrum communications.

The WLAN 109 may also comprise the WLAN network-control functionalitycommonly associated with a WLAN, and the WWAN-access controlfunctionality required to distribute necessary WWAN-access parameters(e.g., node addresses, multiple-access codes, channel assignments,authentication codes, etc.) between active WTs 101-103. The distributionof WWAN-access parameters between multiple WTs 101-103 enables each WT101-103 to be responsive to transmissions intended for a particular WTin the local group and/or it enables a plurality of WTs 101-103 tofunction as a single WT when transmitting signals into the WWAN channel99.

Particular embodiments of the invention provide for adapting either orboth the transmitted data d_(t)(n) and the received data d_(r)(n) inorder to perform beamforming. Specifically, the group of WTs 110 may beadapted to perform antenna-array processing by linking the individualWTs together via WLAN links 109 and employing appropriate antenna-arrayprocessing on the transmitted and/or the received data, d_(t)(n) andd_(r)(n), respectively.

Ad-hoc wireless networks (e.g., multi-hop and peer-to-peer networks) mayemploy intermediate relay nodes to convey transmissions from a source toa destination. Relays reduce the transmission power requirements forsending information over a given distance. This indirectly increases thespatial-reuse factor, thus enhancing system-wide bandwidth efficiency.For this reason, ad-hoc wireless networking works particularly well withunlicensed spectrum, which is characterized by restrictive powerlimitations and high path loss compared to cellular bands. Similarly,for certain embodiments of the invention, it may be preferable to employhigh-loss (e.g., high-frequency) channels for the WLAN connections 109.

The capacity of wireless ad-hoc networks is constrained by interferencecaused by the neighboring nodes, such as shown in P. Gupta and P. R.Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Info. Theory,vol. IT-46, no. 2, March 2000, pp. 388-404 and in A. Agarwal and P. R.Kumar, “Improved capacity bounds for wireless networks.” WirelessCommunications and Mobile Computing, vol. 4, pp. 251-261, 2004, both ofwhich are incorporated by reference herein. Using directional antennas(such as antenna arrays) reduces the interference area caused by eachnode, which increases the capacity of the network. However, the use ofdirectional antennas and antenna arrays on the WTs 101-103 is often notfeasible, especially when there are size constraints, powerrestrictions, cost constraints, and/or mobility needs. Thus, someembodiments of the present invention may provide for enabling WTs toform groups that cooperate in network-access functions. This provideseach member of a given WLAN group with greater network access, as wellas other benefits.

Antenna-array processing is generally categorized as multiple-input,single-output (MISO), single-input, multiple-output (SIMO) or multipleinput, multiple output (MIMO). Array processing often employs beamforming in at least one predetermined signal space or signal sub-space.For example, phased-array processing involves coherent beam-forming ofat least one transmitted signal frequency. Sub-space processing oftenemploys some form of baseband interference cancellation or multi-userdetection. Other variations of phased-array and sub-space processingalso exist and may be implemented in embodiments of the presentinvention.

Sub-space processing is commonly employed via space-time processing(e.g., Rake receivers are employed in a frequency-selective channel)and/or space-frequency processing (e.g., frequency-domain processing isemployed to provide for multiple flat-fading channels). Similarly,sub-space processing may employ other diversity parameters andcombinations thereof, including (but not limited to) polarizationprocessing and code-space processing.

MIMO systems have been shown to significantly increase the bandwidthefficiency while retaining the same transmit power budget andbit-error-rate (BER) performance relative to a single input, singleoutput (SISO) system. Similarly, for a given throughput requirement,MIMO systems require less transmission power than SISO systems. MIMOtechnology is useful for enabling exceptionally high bandwidthefficiency. However, many spatial-multiplexing techniques require richscattering. Increased path loss and poor scattering are major problemsfor MIMO systems operating above 2.4 GHz. For these reasons, lower(e.g., cellular) frequencies are often preferred for MIMO applications.However, some MIMO benefits can also be achieved at higher frequencies.

FIG. 1B illustrates an embodiment of the present invention in whichtransmitted and/or received data between the WLAN group 110 and the WWANterminal 119 occupies parallel, redundant channels c_(n). This approachis distinct from typical cooperative-diversity implementations in whichWWAN data transmissions are conveyed over a plurality of orthogonalchannels. Rather, each of the WTs 101-103 transmits and/or receives on acommon channel c_(n). This enables many well-known types of arrayprocessing to be performed.

The WLAN group 110 may function as either or both a transmitting arrayand a receiving array. The signal received at an antenna array is anoisy superposition of the n transmitted signals:

${y(n)} = {{\sqrt{\frac{E_{s}}{M_{t}}}{{Hs}(n)}} + {v(n)}}$where {s(n)}_(n=0) ^(N-1) is a sequence of transmitted vectors, E_(s)corresponds to the transmit energy assuming that E_(sn∥Sn∥)=1 for n=1, .. . , M_(t), v(n) represents AWGN with zero mean and variance, and H isan M_(r)×M_(t) matrix channel (where M_(r) is the number of receiverelements and M_(t) is the number of transmitter elements), which isassumed constant over N symbol periods. The nominal rank of a rationalmatrix H is the order of the largest minor of H that is not identicallyzero, such as shown in T. Kailath, Linear Systems, Prentice-Hall, Inc.,1980, (especially Sec. 6.5), which is incorporated by reference.

Channel characterization involves finding a set of channel realizations(e.g., functions) that indicate channel quality with respect to someperformance metric (e.g., error probability or asymptotic criteria). Inthe MIMO channel, several variables contribute to the channel quality(and thus, to the optimization of channel quality), including the choiceof space-time codes, receiver-terminal selection, and receiveralgorithm(s) employed.

In one embodiment of the invention, a subset of WTs in a WLAN group maybe selected such as to provide optimal WWAN transmission and/orreception within at least one predetermined constraint, such as anoptimal or maximum number of active WWAN transceivers within the WLANgroup. Such predetermined constraints may be established to optimizesome combination of WWAN link performance and resource use within theWLAN group. In one embodiment, WTs experiencing the best WWAN channelconditions may be selected. Techniques employing antenna selection, suchas may be used for diversity processing with antenna arrays, may be usedin embodiments of the present invention. In one aspect of the invention,resource conservation may focus on WT battery power, MIMO processingcomplexity, and/or WLAN bandwidth.

Certain embodiments of the invention may distinguish between circuitpower (e.g., power used to perform signal processing) versustransmission power. Other embodiments of the invention may provideconsideration for the total battery power (e.g., processing power plustransmission power) budget, such as to provide power (e.g., batteryusage) load balancing between WTs. Thus, embodiments of the inventionmay optimize a balance of signaling parameters, including (but notlimited to) transmission power, channel-coding (and decoding)complexity, modulation, signal processing and the complexity associatedwith cooperative array processing parameters (e.g., number of activearray elements, number of channels, number of WTs employed to performsignal processing, number of WTs in a WLAN group, type ofarray-processing operations, etc.).

Any combination of various channel-characterization functions may beemployed as a measure of link performance. Example functions including,but not limited to, the following may be employed. Possible functionsinclude the average signal strength:

${P(H)} = {\frac{1}{N}{\sum\limits_{n = 0}^{N - 1}\;{H^{(n)}}_{F}^{2}}}$the average mutual information:

${\overset{\_}{I}(H)} = {\frac{1}{N}{\sum\limits_{n = 0}^{N - 1}\;{\log\mspace{11mu}{\det\left( {I_{M_{r}} + {\frac{E_{s}}{N_{o}M_{t}}H^{(n)}H^{{(n)}H}}} \right)}}}}$and the normalized average mutual information:

${\overset{\_}{I}(H)} = {\frac{1}{N}{\sum\limits_{n = 0}^{N - 1}\;{\log\mspace{11mu}{\det\left( {I_{M_{r}} + {\frac{E_{s}}{N_{o}}\frac{1}{\alpha}H^{(n)}H^{{(n)}H}}} \right)}}}}$where

$\alpha = {\frac{1}{{NM}_{t}M_{r}}{\sum\limits_{n = 0}^{N - 1}\;{H^{(n)}}_{F}^{2}}}$is an estimate of the path loss.

Theoretical capacity in a MIMO channel is typically expressed as:C=log_(d) det[I _(M) _(r) +ρ/M _(t) HH*]where ρ is the average SNR.

A preferred embodiment of the invention may employ error-correctingcodes to add structured redundancy to the information bits. This can bedone to provide diversity, such as temporal diversity, spatialdiversity, and/or frequency diversity. Embodiments of the invention mayemploy spreading codes, which are well known in the art. In addition tocollaborative MIMO operations, the WTs may engage in collaborativedecoding. In particular, a WLAN group may be provided with functionalitythat directs the WTs to coordinate WWAN information exchange anddecoding via the WLAN.

In yet another embodiment of the invention, a WWAN terminal may beadapted to receive channel information (and/or even received data) fromWTs, perform array-processing (e.g., MIMO) computations, and then uploadthe resulting array-processing weights to the WTs. The WTs may simplyapply the weights to their transmitted and/or received WWAN signals, andperform any other related operations, such as combining.

FIG. 1C illustrates a WLAN group 110 comprising a plurality of WTs101-103 adapted to communicate with at least one WWAN node 119. A WWANchannel 99 expresses distortions, interference, and noise that affectWWAN transmissions between the WTs 101-103 and the WWAN node 119.Channel estimation characterizes propagation characteristics (e.g.,multipath, shadowing, path loss, noise, and interference) in the WWANchannel.

In one embodiment of the invention, a given WWAN transmission isseparated into spectral components (such as denoted by f₁, f₂, and f₃)by the WLAN group 110. For example, each of the WTs 101-103 may beadapted to receive predetermined spectral components f₁, f₂, and f₃ of agiven transmission intended for a particular WT. Alternatively, each ofthe WTs 101-103 may be adapted to transmit one or more associatedpredetermined spectral components to the WWAN node 119.

The selection of spectral components f₁, f₂, and f₃ and theirassociation with particular WTs 101-103 is typically performed tooptimize WWAN system performance relative to the current WWAN channel99. For example, since the frequency-dependent fading profile in ascattering-rich environment tends to be unique for each spatiallyseparated WT 101-103 channel, the spectral components f₁, f₂, and f₃ arepreferably selected to minimize the effects of deep fades and/orinterference. Spectral-component selection may be selected and/oradapted to optimize one or more WWAN link-performance metrics,including, but not limited to, SNR, BER, PER, and throughput.Spectral-component selection may be performed to achieve otherobjectives, such as to distribute processing loads across the WLAN group110.

The spectral components f₁, f₂, and f₃ may be characterized byoverlapping or non-overlapping frequency bands. Spectral components f₁,f₂, and f₃ may each include continuous or discontinuous (e.g., frequencyinterleaved) frequency-band components. Spectral components f₁, f₂, andf₃ may comprise similar or different bandwidths. Furthermore, thespectral components f₁, f₂, and f₃ may include gaps or notches, such asto notch out interference or deep fades. Accordingly, an aggregatesignal derived from combining the spectral components f₁, f₂, and f₃ mayinclude gaps or notches.

WWAN communication signals may include multicarrier (e.g., OFDM) orsingle-carrier signals. In the case of single-carrier signals, the WTs101-103 can be adapted to perform frequency-domain synthesis and/ordecomposition, such as described in published patent appl. nos.20040086027 and 20030147655, which are hereby incorporated by referencein their entireties.

FIG. 1D illustrates a similar communication-system embodiment to thatshown in FIG. 1C, except that the transmissions between the WWAN node119 and the WTs 101-103 are characterized by different, yetcomplementary, code spaces c₁, c₂, and c₃. In this case, the termcomplementary means that the coded transmissions corresponding to thecode spaces c₁, c₂, and c₃ can sum to produce at least one predeterminedWWAN coded data sequence. This may be a weighted sum due to the givenchannel conditions. A predetermined WWAN coded data sequence may employa code that would ordinarily (in view of the prior art) be employed inwhole. That is, it would not ordinarily be partitioned into sub-codes tobe transmitted by different transmitters or received by differentreceivers.

In one embodiment of the invention, the code spaces c₁, c₂, and c₃correspond to direct-sequence codes, such as may be used to provide forspreading and/or multiple access. A superposition of signals transmittedacross the code spaces c₁, c₂, and c₃ may provide at least onepredetermined WWAN coded data sequence received by at least one WWANnode 119. Similarly, a superposition of signals received by the WTs101-103 and mapped onto the code spaces c₁, c₂, and c₃ may provide atleast one predetermined WWAN coded data sequence that would ordinarily(in view of the prior art) be intended for a single WT. Preferredembodiments of the invention may provide for channel corrections (e.g.,pre-distortion and/or receiver-side channel compensation) by either orboth the WLAN group 110 and the WWAN node 119. Accordingly, the codespaces c₁, c₂, and c₃ may be adapted to account for channel conditions.

In another embodiment of the invention, the code spaces c₁, c₂, and c₃may correspond to direct-sequence codes having predetermined spectralcharacteristics. It is well known that different time-domain datasequences may be characterized by different spectral distributions.Accordingly, embodiments of the invention may provide for selectingcomplementary codes c₁, c₂, and c₃ having predetermined spectralcharacteristics with respect to WWAN channel conditions affecting thelinks between the WTs 101-103 and the WWAN node 119. Thus, the codes c₁,c₂, and c₃ may be selected according to the same criteria employed forselecting the spectral components f₁, f₂, and f₃.

FIG. 1E illustrates an embodiment of the invention in which a first WLANgroup 110 (such as comprising WTs 101-103 connected via WLAN 109) isadapted to communicate with a second WLAN group 120 (such as comprisingWTs 111-113 connected via WLAN 118) via WWAN channel 99. Applications ofthis embodiment may be directed toward peer-to-peer and multi-hopnetworks. Specifically, antenna-array processing (e.g., MIMO operations)may be performed by both WLAN groups 110 and 120. Each WLAN group (suchas WLAN groups 110 and 120) may function as a single node in an ad-hocnetwork, a peer-to-peer network, or a multi-hop network. For example,any communication addressed to (or routed through) a particular node(such as one of the WTs 101-103) may be advantageously processed by oneor more of the WTs 101-103 in the WLAN group 110. In one embodiment,each active WT 101-103 in the WLAN group 110 may be responsive tocommunications addressed to itself and to at least one other WT 101-103in the WLAN group 110.

The WLAN 109 may be used to inform individual WTs 101-103 which nodeaddress(es) (or multiple-access channel assignments) to be responsiveto. Similarly, the WLAN 109 may convey information to WTs 101-103 inorder to spoof node addresses and/or multiple-access information andotherwise help WTs 101-103 assume channelization information related toa particular WT identity prior to transmitting signals into the WWAN.Thus, the WLAN 109 can be used to assist in synchronizing WTinteractions with the WWAN. The functionality of providing for sharingWWAN-access information between WTs 101-103 may be coordinated andcontrolled with respect to cooperative-array (e.g., MIMO) processing.

FIG. 1F shows an embodiment of the invention wherein a WLAN group 110includes a plurality of WWAN-active WTs 101-103 and at least oneWWAN-inactive WT, such as WTs 104-106. The WWAN-active WTs 101-103 maybe configured to directly transmit and/or receive WWAN communicationsignals 129. WWAN-inactive WTs 104-106 are defined as WLAN-connectedterminals that do not directly communicate with the WWAN. Rather, theWWAN-inactive WTs 104-106 may be in a sleep or standby mode.

In a preferred embodiment of the invention, signals routed to and from aparticular WT 101-103 may be provided with beam-forming weights thatallow for phased-array and/or sub-space processing. Calculation of theweights may be facilitated via distributed computing (e.g., as aload-balancing measure) across a plurality of the WTs (101-106). Thisallows the WLAN group 110 to scale the effective throughput of the WWANlink and coordinate system throughput with local area load balancing. Inparticular, the efficiency of the WWAN link is proportional to thesmaller of the number of array elements at the WWAN terminal (not shown)and the number of WWAN-active transceiver antennas linked by the WLAN109. When an equal number N of antennas is employed on both sides of thelink, up to an N-fold increase in the link throughput is possible.Channel coding can be employed to exchange this increase for improvedprobability-of-error performance, increased range, and/or lowertransmission power.

Although the capacity of a MIMO channel increases with the number ofantennas employed at both ends of the link, the complexity of thetransmission and reception algorithms increases accordingly. Forexample, the sphere decoder has a typical complexity of O(M_(T) ⁶),where M_(T) is the number of transmitting antennas, and V-Blast has atypical complexity of O((M_(R)M_(T))³), where M_(R) and M_(T) arerespectively the number of receiving and transmitting antennas. However,the computational power increases only linearly with respect to thenumber of WTs (assuming each WT has identical processing capability).Thus, the aggregate processing power of the WTs may determine themaximum number of active antennas that a WLAN group 110 can support.

One solution to the disparity between required processing power and thenumber of WT processors in a given WLAN group 110 is to ensure that thetotal number of WTs exceeds the number of MIMO channels in the group110. This approach enables at least two significant processingadvantages:

-   -   1) The processing load may be spread over a larger number of        mobile-terminal processors, and    -   2) A form of antenna-switching diversity can be used to optimize        performance and throughput in the MIMO channel.        Antenna switching is a well-known technique that switches        between various antennas and selects ones having the best signal        outputs. This can be done to reduce correlation between        antennas, thereby improving MIMO performance. Antenna switching        is described in G. J. Foschini, M. J. Gans, “On limits of        wireless communication in a fading environment when using        multiple antennas,” Wireless Personal Communications, vol. 6,        no. 3, pp. 311-335, March 1998, which is incorporated by        reference. In some embodiments of the invention, WTs having the        most favorable WWAN channel characteristics may be selected to        improve MIMO performance without any increase in processing        complexity.

In some embodiments of the invention, one or more WWAN-inactive WTs104-106 may be employed for WLAN-based functions, such as (but notlimited to) WLAN network control, distributed-computing applications,and WWAN-interface control. For example, WLAN network control mayinclude any of the well-known network-control functions, such asterminal identification, authentication, error correction, routing,synchronization, multiple-access control, resource allocation, loadbalancing, power control, terminal-state management, hand-offs, etc.

The WLAN 109 may employ distributed computing across a plurality of theWTs. Distributed computing may be employed simply to achieve increasedprocessing power. Alternatively, distributed computing may include otherobjectives, such as balancing computational processing loads orbalancing power consumption across the WTs 101-106 in the WLAN group110. Computational loads on the WLAN group can potentially include anyWWAN-related computations, such as WWAN channel estimation, WWAN channelcompensation, diversity combining, WWAN channel coding/decoding, andcooperative array processing (e.g., MIMO weight calculation,interference cancellation, multi-user detection, matrix operations, andother smart antenna array processing operations).

WWAN-interface control may include distributing WWAN data and controlinformation between the WTs 101-106. In one exemplary embodiment of theinvention, at least one of the WTs 101-106 comprises a data source thatdistributes its data to at least one other WT 101-106 for transmissioninto the WWAN. In a similar embodiment of the invention, received WWANsignals intended for a particular WT 101-106 are received by a pluralityof WWAN-active WTs 101-103. The received WWAN signals may optionally beprocessed by one or more WTs 101-106 prior to being routed to theintended WT 101-106. Accordingly, WWAN channel-access information may berouted to a plurality of WWAN-active WTs 101-103 such that they functiontogether as a single WT 101-106.

The determination of which WTs 101-106 are active is typically performedby decision processing within the WLAN group 110 that determines whichWTs 101-106 have the highest quality WWAN channel(s). The number ofWWAN-active WTs (such as WTs 101-103) may be determined by one or morefactors, including WT channel quality, array-processing complexity,available computational resources within the WLAN group 110, loadbalancing, and information-bandwidth requirements. In an alternativeembodiment of the invention, the WWAN assigns cooperative channel-accessinformation to the WTs 101-103 and may optionally determine which WTs101-106 are active.

Some embodiments of the invention may take into consideration not onlythe MIMO complexity at the WTs, but also the added complexity associatedwith distributing the computational loads over WTs in a given WLANgroup. Both MIMO and distributed computing overheads can becharacterized as a function of the number of WTs in a WLAN group.Furthermore, the information bandwidth of a given WLAN channel limitsthe rate of information exchange between WTs. Accordingly, local channelconditions within the WLAN may affect throughput and range, and thuslimit the number of WTs within the WLAN group. Either the WLAN capacityor the computational capability of each WT may set a practical limit onthe number of WTs in a WLAN group and the overall frequency-reusefactor.

Another important factor that can impact the WLAN group size is thechannel rate-of-change, which may be due to motion of the WTs and/orother objects in the WWAN environment. In particular, rapidly changingchannel conditions may necessitate frequent updates to the MIMOcomputations, thus increasing the computational load on WLAN group andpotentially increasing the required data transfer across the WLAN.Similarly, local channel conditions may dictate the flow of data ifdistributed computing is employed.

MIMO systems experience substantial degradation in data transfer ratesin mobile channels. Time-varying multipath-fading profiles commonlyexperienced in a mobile wireless network exhibit deep fades that oftenexceed 30 dB. Commercial viability of some embodiments of the presentinvention requires the ability to tolerate a rapidly changing channel. Apromising approach to this problem is to employ diversity to reduce thechannel rate-of-change. In a wideband system, or equivalently, in asystem comprised of a number of narrowband subcarriers distributed(e.g., interleaved) over a wide frequency band, deep fades affect only aportion of the total channel bandwidth. Therefore, frequency and/orspatial diversity may be employed to reduce the likelihood of deep fadesin a multipath environment. Similarly, alternative forms of diversitymay be employed. In a mobile environment, this translates into reducingthe channel rate-of-change.

FIG. 1G illustrates a cooperative beam-forming embodiment of theinvention that functions in the presence of a desired WWAN terminal 119and an external interference source (or jammer) 118. WTs 101-103 in aWLAN group 110 may coordinate their received aggregate beam pattern(s)to null out a jamming signal 115. Array-processing operations performedon signals received from the WTs 101-103 may take the form ofphased-array processing, which minimizes the array's sensitivity tosignals arriving from one or more angles. Alternatively, arrayprocessing may employ baseband (or intermediate-frequency) interferencecancellation. Similarly, beam-forming operations may be employed tocancel emissions transmitted toward one or more terminals (such asjammer 118).

FIG. 1H illustrates a cooperative beam-forming embodiment of theinvention configured to function in the presence of a plurality ofdesired WWAN terminals 119 and 127. In one embodiment of the invention,the WWAN terminals 119 and 127 may be common to a particular WWAN, andthe configuration illustrated in FIG. 1H may include a soft hand-off inwhich redundant transmissions are transmitted between the WLAN group 110and the WWAN terminals 119 and 127. In this case, the WLAN group may bedistributed geographically over a plurality of WWAN sectors or cells. Inone aspect of the invention, the WLAN group 110 may adapt itsconnectivity with the WWAN to transition to the cell or sector offeringthe optimal aggregate WWAN channel quality. Accordingly, the WLAN groupmay adapt its selection of WWAN-active WTs in response to a hand off.

In another embodiment of the invention, the WLAN group 110 may employ afirst WWAN connection (such as illustrated by a connection between WTs101 and 102, and WWAN terminal 119) and a second WWAN connection (suchas illustrated by a connection between WT 103 and WWAN terminal 127) totransmit and/or receive one or more data streams. The WLAN group 110 mayemploy a plurality of WWAN user channels in a given WWAN. Similarly, theWLAN group 110 may employ connections to a plurality of different WWANs.

FIG. 1I illustrates an embodiment of the invention that provides aplurality of WTs 101-106 in a WLAN group 110 with access to a pluralityof WWAN services (i.e., WWANs). For example, WT 101 is provided with acommunication link with an IEEE 802.16 access-point terminal 116 in anIEEE 802.16 network, WT 102 maintains access capabilities to a3G-cellular terminal 119, and WT 103 has connectivity to an IEEE 802.11access point 117. WLAN connectivity 109 is adapted to enable any of theWTs 101-106 in the WLAN group 110 to access any of the plurality of WWAN(802.16, 3G, and 802.11) services.

The WLAN 109 may include a WWAN-access controller (not shown), which maytake the form of WLAN-control software residing on a physical device,such as one or more WTs 101-106. Connectivity of the WTs 101-106 to theavailable WWAN services may be performed with respect to a combinationof technical rules and business rules. For example, WWAN access istypically managed using technical rules, such as network load balancing,power conservation, and minimizing computational processing loads.However, WWAN access can also be influenced by business rules, such asenabling a predetermined cost/service ratio for individual WTs 101-106.For example, the WWAN-access controller (not shown) can anticipate theeconomic cost of particular WWAN services to the user, as well as usercommunication needs, when assigning WWAN access to individual WTs101-106. Each WT 101-106 may provide the WWAN-access controller (notshown) with a cost tolerance, which can be updated relative to the typeof communication link desired. For example, high-priority communicationneeds (such as particular voice communications or bidding on an onlineauction) may include permissions to access more expensive WWANconnections in order to ensure better reliability.

The overall goal of WWAN access may be to achieve optimal connectivitywith minimum cost. Accordingly, WWAN-access algorithms may includeoptimization techniques, including stochastic search algorithms (likemulti-objective genetic algorithms). Multi-objective optimization arewell known in the art, such as described in E. Zitzler and L. Thiele,“Multiobjective evolutionary algorithms: A comparative case study andthe strength pareto approach,” IEEE Tran. on Evol. Comput, vol. 3, no.4, November 1999, pp. 257-271 and J. D. Schaffer, “Multiple objectiveoptimization with vector evaluated genetic algorithms,” Proceedings of1st International Conference on Genetic Algorithms, 1991, pp. 93-100,both of which are incorporated by reference.

A WWAN-access controller (not shown) preferably ensures an uninterruptedsession when transitioning from one WWAN to another. In particular, thetransition between different WWANs should be invisible to the user. Thisrequires that the WWAN-access controller (not shown) be adapted to storeuser state information (e.g., save browser pages or buffer multimediadata streams). Furthermore, back-end systems may preferably be employedto manage cooperative WWAN access in order to consolidate differentWWAN-access charges into a single bill for the user.

In FIG. 1J, a plurality of WTs 101-106 in a WLAN group 110 includes atleast one WWAN terminal 106. The WTs 101-105 may contribute beam-formingcapabilities to the WWAN terminal 106, such as to increase range,increase spatial reuse, reduce transmission power, and/or achieve any ofother various beamforming objectives.

In one embodiment of the invention the WTs 101-105 function as lens forWWAN signals transmitted and received by the WWAN terminal 106. Forexample, the WTs 101-106 may collect received WWAN signals and thenfocus retransmitted WWAN signals at the WWAN terminal 106. Similarly,the WTs 101-105 may assist in the transmission of WWAN signals from theWWAN terminal 106 to one or more remote sources. In essence, the WTs101-105 may function like a radio relay, but with directionality andfocusing capabilities. In this embodiment, the WLAN connectivity of WTs101-105 with the WWAN terminal 106 may not be necessary.

In another embodiment of the invention, one or more of the WTs 101-106,such as WWAN terminal 106, may be adapted to process the majority (orentirety) of necessary beam-forming computations. In this case, WT 106is designated as a computer-processing terminal. The computer-processingterminal 106 is adapted to include specific computational resources forprocessing WWAN signals received by other WTs (such as WTs 101-103),which are then relayed via the WLAN 109 to the computer-processingterminal 106. Similarly, the computer-processing terminal 106 may beadapted to perform signal-processing operations associated with WWANtransmission. Computational operations associated with other WWANsignal-processing operations (e.g., coding, decoding, channelestimation, network-access control, etc.) may be provided by thecomputer-processing terminal 106.

FIG. 2A illustrates a functional embodiment of the invention that may berealized in both method and apparatus embodiments. A plurality M of WWANInterfaces 1101.1-1101.M is provided for coupling WWAN signals to and/orfrom at least one WWAN. In one functional embodiment, WWAN Interfaces1101.1-1101.M may include WWAN transceivers adapted to convert receivedWWAN signals into received baseband signals. A plurality of WWANbaseband processors 1102.1-1102.M are optionally provided for performingbaseband processing (such as, but not limited to, channel compensation,A/D conversion, frequency conversion, filtering, and demultiplexing) onthe received baseband signals. Alternatively, the function of the WWANbaseband processors 1102.1-1102.M may be performed by the WWANInterfaces 1101.1-1101.M.

Baseband outputs from the WWAN baseband processors 1102.1-1102.M arecoupled into a plurality of array processors, such as MIMO combiners1103.1-1103.M. In a MIMO channel, the received WWAN signals (and thus,the baseband outputs) are characterized by a plurality of overlapping(i.e., interfering) signals. Although MIMO combiners 1103.1-1103.M areshown, any type of array processor may be employed. The number of arrayprocessors may be less than, equal to, or greater than the number M ofWWAN Interfaces 1101.1-1101.M. Baseband outputs may also be coupled intoa WLAN 1105, which is coupled to the plurality of MIMO combiners1103.1-1103.M. Each MIMO combiner 1103.1-1103.M may be adapted toreceive baseband outputs from two or more baseband processors1102.1-1102.M wherein at least one of those baseband outputs is coupledto the MIMO combiner 1103.1-1103.M via the WLAN 1105.

A particular m^(th) MIMO combiner 1103.m need not process data from acorresponding (m^(th)) WWAN Interface 1101.m. Rather, the m^(th) MIMOcombiner 1103.m may process baseband signal outputs from a plurality ofWWAN Interfaces 1101.p {p=1, . . . M, where p≠m}.

The WLAN 1105 comprises at least one WLAN channel between at least onebaseband output (e.g., baseband processor 1102.1-1102.M outputs) and atleast one array processor, such as the MIMO combiners 1103.1-1103.M. TheWLAN 1105 may include WLAN interfaces (not shown) and associatedWLAN-control hardware and/or software (not shown).

The MIMO combiners 1103.1-1103.M may be adapted to separate theoverlapping signals and output at least one desired transmissiontherefrom. Outputs of the MIMO combiners 1103.1-1103.M are optionallyprocessed by secondary data processors 1104.1-1104.M, which may providecoupling into the WLAN 1105. The secondary data processors 1104.1-1104.Mmay be adapted to perform demodulation, error-correction decoding, dataformatting, and/or other related baseband-processing functions.

In some embodiments of the invention, MIMO combiner 1103.1-1103.Moutputs may be coupled via the WLAN 1105 to other MIMO combiners1103.1-1103.M and/or secondary data processors 1104.1-1104.M. Forexample, embodiments of the invention may employ an iterativecancellation process, such as successive interference cancellation(which is well-known in the art), involving the use of strongest-signalestimates, and then next-strongest-signal estimates to cancel knowninterference in weaker signals. Alternatively, embodiments may employparallel cancellation.

FIG. 2B illustrates an embodiment of the invention including a pluralityM of WTs 1109.1-1109.M, each comprising a corresponding combination of aWWAN Interface 1101.1-1101.M, an optional WWAN baseband processor1102.1-1102.M, a combiner (such as a MIMO combiner 1103.1-1103.M), and asecondary data processor 1104.1-1104.M. The WTs 1109.1-1109.M arecoupled together by a WLAN 1105, which is configured to convey databetween the WTs 1109.1-1109.M in order to enable cooperativeantenna-array processing.

A WT, such as any of the WTs 1109.1-1109.M, includes any system ordevice provided with communicative connectivity means to a WLAN 1105.Two or more WTs 1109.1-1109.M are preferably provided with WWANinterfaces, such as WWAN Interface 1101.1-1101.M. A plurality of WTs1109.1-1109.M may share at least one WLAN 1105. In one embodiment of theinvention, individual WTs 1109.1-1109.M may share the same WWAN service.This enables the WLAN group 110 to perform either or both transmitbeam-forming and receive beam-forming (i.e., combining) operations.

In another embodiment of the invention, WTs 1109.1-1109.M may haveconnections to different WWANs and/or WWAN services. This enables theWLAN group 110 to achieve WWAN-service diversity. One or more WTs1109.1-1109.M may optionally be capable of accessing multiple WWANservices. For example, many cellular handsets are provided withmulti-mode capabilities, which give them the ability to access multipleWWANs. Some of the WTs 1109.1-1109.M may have no WWAN service. Forexample, one or more WTs 1109.1-1109.M may be out of range, in a WWANdead spot, in an inactive WWAN state, or configured only to communicatevia the WLAN 1105. WTs 1109.1-1109.M include, but are not limited to,cell phones, radio handsets, pagers, PDAs, wireless sensors, RFIDdevices, vehicle radio communication devices, laptop computers withwireless modems, wireless network access points, wireless routers,wireless switches, radio repeaters, transponders, and devices adapted toinclude satellite modems.

A WLAN group 110 may be adapted to perform any of various types andcombinations of diversity and MIMO beam-forming. Three commonly usedlinear diversity-combining techniques include switched (or selection)combining, maximal ration combining (MRC), and equal gain combining(EGC). Other combining techniques may be employed. The impact of usingdiversity may be expressed by a probability distribution p(γ) of the SNRγ at the output of a combining network. For switched diversity, whereinthe combiner switches to the diversity branches (e.g., WTs) having thestrongest signal, p(γ) is given by:

${p(\gamma)} = {\frac{L}{\Gamma}{e^{{- \gamma}/\Gamma}\left\lbrack {1 - e^{{- \gamma}/\Gamma}} \right\rbrack}^{L - 1}}$where Γ is the average SNR for each diversity branch and L is the numberof diversity branches. MRC weights branches (e.g., WT signals receivedfrom the WWAN) having better SNR more heavily (i.e., withgreater-magnitude weights) than branches having poorer SNR. The p(γ) forMRC is given by:

${p(\gamma)} = \frac{\gamma^{l - 1}e^{{- \gamma}/\Gamma}}{{\Gamma^{L}\left( {l - 1} \right)}!}$For EGC, p(γ) is given by:

${p(\gamma)} = {\frac{L}{a\;\Gamma}{e^{{{- \gamma}/a}\;\Gamma}\left\lbrack {1 - e^{{{- \gamma}/a}\;\Gamma}} \right\rbrack}^{L - 1}}$where a=√{square root over (L/1.25)} for L≥2, and 1 otherwise.These diversity techniques provide the greatest improvements when thebranches are uncorrelated.

Adaptive arrays (or smart antennas) may include antenna systems thatautomatically adjust to achieve some predetermined performancecriterion, such as maximizing the signal to interference (S/I) ratio,SINR, or link margin. Adaptive antenna techniques include switched beam,beam steering, and optimum combining (e.g., a linear spatial filteringapproach that employs adaptation to closely match an output signal witha reference signal). A filtering process typically suppresses anyartifacts that are not part of the desired incoming signal, includingnoise and interference.

In an optimum combining system, signals from each WT are down convertedto baseband and converted to digital signals in an ADC. Noise associatedwith the front end of the down converter and other sources is naturallyadded to the signal. The resulting signal x_(m)(k) is multiplied by acomplex weighting function w_(m)(k) and summed with similar signals fromother WT antenna elements. The resulting sum signal Σw_(m)(k)x_(m)(k) iscompared with a previously derived (and updated) reference signal (e.g.,a training sequence). An error signal e(k) is generated and used toadjust the weight values in order to minimize e(k). The objective is toderive the weighting function w_(m)(k) that enables the best matchbetween an estimated received signal and the actual transmitted signal.Alternatively, an adaptive WT array may be configured as an analog arraywherein amplitude and phase adjustments (i.e., weighting functions) areperformed at RF or IF.

In a MIMO communication system, signals transmitted from M_(T) transmitsources interfere with each other at a receiver comprising the WTs1109.1-1109.M. Thus, interference cancellation (such as matrixinversion, channel transfer function inversion, and adaptive filtering)may be employed by one or more MIMO combiners 1103.1-1103.M to separatethe signals. The received signal is expressed by:y=Hx+nwhere the received signal, y, is a vector with M_(R) terms {y_(i), i=1,. . . ,N_(R)} corresponding to signals received by M_(R) (where M_(R)may have a value of 2 to M) receiver elements (i.e., WTs); x representsthe transmitted signal, which is a vector having M_(T) terms {x_(i),i=1, . . . ,M_(T)} corresponding to signals transmitted by M_(T)transmitter elements; His an M_(R)×M_(T) channel-response matrix thatcharacterizes the complex gains (i.e., transfer function, or spatialgain distribution) from the M_(T) transmission elements to the M_(R)receive elements; and n represents AWGN having zero mean and zerovariance.

In the case where the channel is characterized by flat fading, such aswhen a narrowband signal is employed (e.g., a sub-carrier of amulti-carrier signal), the elements in matrix H are scalars. Thechannel-response matrix H may be diagonalized by performing aneigenvalue decomposition of the M_(T)×M_(T) correlation matrix R, whereR=H^(H)H. Eigenvalue decomposition is expressed by:R=EDE ^(H)where E is an M_(T)×M_(T) unitary matrix with columns corresponding tothe eigenvectors e_(i) of R, and D is an M_(T)×M_(T) diagonal matrixwherein the diagonal elements are eigenvalues λ_(i) of R. The diagonalelements of D indicate the channel gain for each of the independent MIMOchannels. Alternatively, other eigenvalue-decomposition approaches, suchas singular value decomposition, may be employed.

The process for diagonalizing the MIMO channel response is initiated bymultiplying a data vector d with the unitary matrix E to produce thetransmitted vector x: x=Es. This requires the transmitter to have someinformation corresponding to the channel-response matrix H, or relatedinformation thereof. The received vector y is then multiplied withE^(H)H^(H) to provide an estimate of data vector s, which is expressedby:ŝ=E ^(H) H ^(H) y=E ^(H) H ^(H) HEs+E ^(H) H ^(H) n=Ds+{circumflex over(n)}where {circumflex over (n)} is AWGN having a mean vector of 0 and acovariance matrix of Λ_(n)=σ²D.

The data vector s is transformed by an effective channel responserepresented by the diagonal matrix D. Thus, there are N_(s)non-interfering subchannels wherein each subchannel i has a power gainof λ_(i) ² and a noise power of σ²λ_(i).

In the case where MIMO processing is performed on a multicarrier signal,or some other wideband signal that is spectrally decomposed intonarrowband components, eigenmode decomposition may be performed for eachfrequency bin f_(n).

If multicarrier spreading codes are employed (e.g., orthogonal DFT, orCI, codes), the channel-response matrix H can cause inter-symbolinterference between spread data symbols, even in a SISO arrangement.Accordingly, the eigenmode decomposition technique described previouslyis applicable to multicarrier spreading and despreading. In oneembodiment of the invention, eigenmode decomposition may be appliedacross two or more dimensions (e.g., both spatial and frequencydimensions). In another embodiment of the invention, eigenmodedecomposition may be applied across a single dimension (e.g., spatial orfrequency dimensions). For example, multicarrier spreading codes (forexample, orthogonal codes for data multiplexing in a givenmultiple-access channel) may be generated and processed via eigenmodedecomposition.

Any of various water-filling or water-pouring schemes may be employed tooptimally distribute the total transmission power over the availabletransmission channels, such as to maximize spectral efficiency. Forexample, water-filling can be used to adapt individual WT transmissionpowers such that channels with higher SNRs are provided withcorrespondingly greater portions of the total transmit power. Atransmission channel, as defined herein, may include a spatial (e.g., asub-space) channel, a space-frequency channel, or some other channeldefined by a set of orthogonalizing properties. Similarly, water fillingmay be used at a physically connected (i.e., wired) antenna array. Thetransmit power allocated to a particular transmission channel istypically determined by some predetermined channel-quality measurement,such as SNR, SINR, BER, packet error rate, frame error rate, probabilityof error, etc. However, different or additional criteria may be employedwith respect to power allocation, including, but not limited to, WTbattery life, load balancing, spatial reuse, power-control instructions,and near-far interference.

In conventional water filling, power allocation is performed such thatthe total transmission power P_(T) is some predetermined constant:

$P_{T} = {\sum\limits_{j \in K}\;{\sum\limits_{k \in L}\;{P_{j}(k)}}}$where L={1, . . . ,N_(s)} signifies the available subspaces and K={1, .. . , N_(f)} represents the available sub-carrier frequencies f_(n). Thereceived SNR (expressed by ψ_(j)(k)) for each transmission channel isexpressed by:

${\psi_{j}(k)} = \frac{{P_{j}(k)}{\lambda_{j}(k)}}{\sigma^{2}}$for j={1, . . . , N_(s)} and k={1, . . . ,N_(f)}The aggregate spectral efficiency for the N_(s)N_(f) transmissionchannels is expressed by:

$C = {\sum\limits_{j = 1}^{N_{s}}\;{\sum\limits_{k = 1}^{N_{f}}\;{\log_{2}\left( {1 + {\psi_{j}(k)}} \right)}}}$

The modulation and channel coding for each transmission channel may beadapted with respect to the corresponding SNR. Alternatively,transmission channels may be grouped with respect to their data-carryingcapability. Thus, groups of transmission channels may share commonmodulation/coding characteristics. Furthermore, transmission channelshaving particular SNRs may be used for particular communication needs.For example, voice communications may be allocated to channels havinglow SNRs, and thus, data-carrying capabilities. In some cases,transmission channels that fail to achieve a predetermined threshold SNRmay be eliminated. In one embodiment of the invention, water filling isemployed such that the total transmission power is distributed overselected transmission channels such that the received SNR isapproximately equal for all of the selected channels.

An embodiment of the invention may employ reliability assessment fordetermining required processing and virtual-array size (i.e., the numberof active WTs functioning as WWAN receiver elements). Received bits orsymbols that have low reliability need more processing. Bits or symbolswith high reliability may be processed with fewer elements (WTs) orprovided with lower processing requirements. More information typicallyneeds to be combined for data streams having less reliability and lessinformation may need to be combined for data streams having morereliability. Also, nodes (WTs) with good channel quality may share moreinformation via the WLAN than nodes having poor channel quality.Optimization algorithms, such as water-filling algorithms may beemployed in the reliability domain.

FIG. 3A illustrates an embodiment of the invention in which a WLANcontroller for a WLAN group of WTs first identifies received datastreams that have the least reliability (e.g., reliability that is belowa predetermined threshold) 301. Then the WLAN controller increasesallocated processing (e.g., increases the number of receiver nodes,increases the number of processing nodes, employs a processing approachhaving higher computational complexity, etc.) 302 to those data streams.Data symbols may be combined from the smallest number of nodes such thatthe reliability of the sum is maximized, or at least exceeds apredetermined threshold reliability. The processes 301 and 302 may berepeated 303 until a predetermined result is achieved or until there isno more data left for processing.

FIG. 3B illustrates an embodiment of the invention in which a WLANcontroller identifies received data streams that have the mostreliability, or data streams having reliability that exceeds apredetermined reliability threshold 311. The WLAN controller maydecrease allocated processing (e.g., decrease the number of receivernodes, decrease the number of processing nodes, employ a processingapproach having lower computational complexity, etc.) 312 to those datastreams. The processes 301 and 302 may be repeated 303 until apredetermined result is achieved or until there is no more data left forprocessing. Embodiments of the invention may provide for encodinginformation across channels having a wide range of reliability.

Embodiments of the invention may be configured to perform blind signalseparation (BSS), such as independent component analysis. For example,A. Jourjine, S. Rickard, and O. Yilmaz, “Blind Separation of DisjointOrthogonal Signals: Demixing N Sources from 2 Mixtures,” in Proceedingsof the 2000 IEEE International Conference on Acoustics, Speech, andSignal Processing, Istanbul, Turkey, June 2000, vol. 5, pp. 2985-88,which is included herein by reference, describes a blind sourceseparation technique that allows the separation of an arbitrary numberof sources from just two mixtures, provided the time-frequencyrepresentations of the sources do not overlap. The key observation inthe technique is that for mixtures of such sources, each time-frequencypoint depends on at most one source and its associated mixingparameters.

In multi-user wireless communication systems that employ multipletransmit and receive antennas, the transmission of user informationthrough a dispersive channel produces an instantaneous mixture betweenuser transmissions. BSS may be used in such instances to separatereceived transmissions, particularly when training sequences and channelestimation are absent. In an exemplary embodiment of the invention, anOFDM-MIMO protocol may be provided across multiple independent WTs.Multiple transmissions are provided on at least one frequency channel,and frequency-domain techniques of BSS may be employed to recoverreceived signals.

In one embodiment of the invention, at least one data transmissionsource may be adapted to convey its data across the WLAN to a pluralityof WTs for transmission into the WWAN. In another embodiment of theinvention, a plurality of WTs are adapted to receive data transmissionsfrom a WWAN and couple said received data transmissions into a WLAN(with or without baseband processing) wherein centralized or distributedsignal-processing means are provided for separating the datatransmissions. Said signal-processing means includes any MIMO-processingtechniques, including multi-user detection, space-time processing,space-frequency processing, phased-array processing, optimal combining,and blind source separation, as well as others.

In one embodiment of the invention, a vector of binary data symbols b(n) are encoded with a convolutional encoder to produce a coded signal:s _(i)(n)=b _(i)(n)*c(n)where c(n) represents a convolutional code of length L′. A cluster of Ncoded symbols corresponding to an i^(th) user, data source, or datastream is represented by:s _(n,i)=[s _(i)(n), . . . ,s _(i)(n+N−1)]^(T)The transmit signal is generated by performing an N-point IDFT tos_(n,i) to produce:S _(n,i)=[S _(i)(n,0), . . . ,S _(i)(n,N−1)]^(T).where

${S_{i}\left( {n,k} \right)} = {\sum\limits_{m = 0}^{N - 1}\;{{s_{i}\left( {n + m} \right)}e^{i\; 2\pi\;{{km}/N}}}}$

The values S_(i)(n,k) are transmitted via at least one of N_(t) transmitantennas.

On the receive side, N_(r) receive antennas (typically, N_(r)≥N_(t)) areemployed. The signal received by a j^(th) antenna is expressed by:

${R_{j}(n)} = {{\sum\limits_{i = 1}^{N_{t}}\;{{S_{i}(n)}*h_{ij}}} + {n_{j}(n)}}$where n_(j)(n) represents the zero-mean AWGN introduced by the channel,and h_(ij) is the channel impulse-response of the i^(th) transmitantenna to the j^(th) receive antenna. The received signal can beinterpreted as a convolutive mixture of the coded signals, where thechannel matrix h represents the mixing system. An N-point DFT is appliedto the received signals R_(j)(n) to produce:r _(j)=[r _(j)(n), . . . ,r _(j)(n+N−1)]^(T)where

${r_{j}(n)} = {\sum\limits_{m = 0}^{N - 1}\;{{R_{j}\left( {n + m} \right)}e^{{- i}\; 2\pi\;{{km}/N}}}}$Typically, a sufficient guard interval or cyclic prefix is employed toeliminate inter-symbol interference.

The signals from the N_(r) receiver antennas are grouped with respect tofrequency bin. An observation at a k^(th) frequency bin are expressedby:r _(n)(k)=[r ₁(n+k),r ₂(n+k), . . . ,r _(N) _(r) (n+k))]^(T)=H(k)s(k)+n(k)Thus, the observations r_(n)(k){k=0, . . . , N−1} can be interpreted asan instantaneous mixture of the transmitted signals s(k), where H(k)represents the mixing system.

There are many approaches for estimating the transmitted signals s(k)from the received signals r_(n)(k) that may be employed by the currentinvention. An exemplary embodiment of the invention employs BSStechniques. One class of BSS produces an output vector having thefollowing form:y(k)=W ^(H)(k)r _(n)(k)where W(k) is an N_(r)×N_(t) matrix that groups the coefficients of theseparating system. The output y(k) can also be expressed by:y(k)=G(k)s(k)+W ^(H)(k)n(k)where G(k)=W^(H)(k)H(k) represents the mixing/separating system. Thegoal of the separation process is to calculate the matrices W(k) so thatthe G(k) matrices are diagonal and the effects of noise W^(H)(k)n(k) areminimized. Many different approaches are applicable for achieving thesegoals.

A BSS algorithm (such as the one described in J. F. Cardoso, A.Souloumiac, “Blind Beamforming for non-Gaussian Signals,”IEEE-Proceedings-F, vol. 140, no. 6, pp. 362-370, December 1993, whichis incorporated by reference herein) may be employed to separate theinstantaneous mixture in each frequency bin. Each output at frequencybin k′ can be regarded as corresponding to a single source at bin k′multiplied by a particular gain introduce by the algorithm. The outputsy(k′) are then used as reference signals in order to recover the sourcesat frequencies k′±1. For example, the separation matrices W(k) aredetermined by minimizing the mean-square error between the outputsy(k)=W^(H)(k)r_(n)(k) and reference signals y(k′). For a given frequencybin k:W _(o)(k)=arg min_(W(k)) E└|y(k)−αy(k′)|²┘where α is a real constant, which is selected with respect to theconvolutional code:

$\alpha = \frac{\sum\limits_{p = 0}^{L - 1}\;{c^{2}(p)}}{\sum\limits_{p = 0}^{L - 2}\;{{c(p)}{c\left( {p + 1} \right)}}}$This is done to ensure G(k)=G(k′). The solution to the optimizationproblem is given by:W _(o)(k)=αR _(r) _(n) ⁻¹(k)R _(r) _(n) _(y)(k,k′)whereR _(r) _(n) (k)=E[r _(n)(k)x ^(H)(k)] andR _(r) _(n) _(y)(k,k′)=E[r _(n)(k)y ^(H)(k′)]

FIG. 4A illustrates an embodiment of the invention wherein a plurality Mof WTs 1109.1-1109.M is coupled to a MIMO processor 1103 via a WLAN1105. In this particular embodiment, a computer-processing terminal 1119may include the MIMO processor 1103. The computer processing terminal1119 may be provided with WLAN-interface functionality, and mayoptionally include WWAN-interface functionality.

The computer-processing terminal 1119 may include any of a pluralityWLAN-connected devices with signal-processing capability. For example,the computer-processing terminal 1119 may include one of the WTs1109.1-1109.M. In one aspect of the invention, the computer-processingterminal 1119 comprises a WLAN controller. In another aspect of theinvention, the computer processing terminal 1119 comprises a networkgateway, router, or access point including a CPU adapted to processsignals received from the plurality of WTs 1109.1-1109.M. Applicationsof embodiments of the invention include (but are not limited to) sensornetworks, micro-networks, RFID systems, cellular networks, and satellitenetworks.

Each WT 1109.1-1109.M may include a baseband processor 1102.1-1102.Madapted to provide WWAN baseband (or IF) signals to the MIMO processor1103 via the WLAN 1105. The MIMO processor 1103 may be configured toseparate interfering WWAN data symbols in the WWAN baseband signals. Theseparated WWAN data symbols are then coupled back to data processors1104.1-1104.M in the WTs 1109.1-1109.M.

FIG. 4B illustrates a functional embodiment of the invention in whichMIMO processing operations (represented by MIMO processors1103.1-1103.M) may be distributed over two or more WTs 1109.1-1109.M.Baseband processors 1102.1-1102.M provide WWAN baseband signals to aWLAN controller 1106, which may distribute the signals (andsignal-processing instructions) to the MIMO processors 1103.1-1103.M.The separated WWAN data symbols are then coupled back to data processors1104.1-1104.M.

FIG. 4C represents a functional embodiment of the invention. At leastone WT may provide WWAN access information 1140 to a WLAN controller.The WWAN access information typically includes necessary information(such as at least one WWAN channel assignment, authentication codes,etc.) to access at least one particular WWAN channel. The WWAN accessinformation may optionally include performance information, such as WWANchannel estimates, link-bandwidth demand, link priority, and/or WWANchannel-quality measurements (e.g., SNR, SINR, BER, PER, latency etc.).This information is typically provided to the WLAN controller by one ormore WTs.

The WLAN controller determines which WTs to activate 1141 for aparticular WWAN communication link. This may be performed for either orboth transmission and reception. The determination of which WTs will beactive 1141 in a given WWAN link typically depends on a combination offactors, including (but not limited to) the number M of WTs required toachieve predetermined channel characteristics or access parameters,which WTs have the best WWAN channel quality, load balancing,power-consumption balancing, computational overhead, latency, andWLAN-access capabilities. Accordingly, the WLAN controller may sendcontrol information via the WLAN to the WTs that includes stateinformation (e.g., operating-mode assignments, such as active, standby,sleep, and awake).

The WLAN controller may convey WWAN information to the active WTs 1142.The WWAN information may be derived from the WWAN access information andprovided to the WTs to establish and/or maintain at least one WWAN link.Accordingly, the WWAN information may include WWAN channel assignments.The WWAN information may include beam-forming weights and/or space-timecodes. Accordingly, the step of conveying WWAN information to the WTs1142 may optionally include a preliminary signal-processing step (notshown), such as blind adaptive or deterministic weight calculation. Thispreliminary signal-processing step (not shown) may be distributed amonga plurality of the WTs, or it may be performed in a centralized mode,such as by a single computing terminal. A distributed-computing mode maytake various forms. In one mode, each of a plurality of WTs takes itsturn functioning as a computing terminal. In another mode, multiple WTsfunction as computing terminals simultaneously.

Communications in the WWAN link are coordinated between the WTs in orderto synchronize the transmitted and/or received WWAN signals 1143. Areceiver embodiment of the invention may provide for synchronizing thereceived WWAN signals, such as to provide for coherent combining. Atransmitter embodiment of the invention may provide for synchronizingthe transmitted WWAN signals from the WTs such as to enable coherentcombining at some predetermined WWAN terminal.

An optional transmitter embodiment of the invention may employsynchronization to deliberately time-offset signals arriving at one ormore WWAN terminals in order to provide for transmit diversity by theWTs. In such embodiments, one or more of the WT transmissions may beprovided with time-varying complex weights (e.g., amplitudes and/orphases), such as described in S. A. Zekavat, C. R. Nassar and S.Shattil, “Combined Directionality and Transmit Diversity via SmartAntenna Spatial Sweeping,” proceedings of 38^(th) Annual AllertonConference on Communication, Control, and Computing, University ofIllinois in Urbana-Champaign, pp. 203-211, Urbana-Champaign, Ill., USA,October 2000, S. A. Zekavat, C. R. Nassar and S. Shattil, “Smart antennaspatial sweeping for combined directionality and transmit diversity,”Journal of Communications and Networks (JCN), Special Issue on AdaptiveAntennas for Wireless Communications, Vol. 2, No. 4, pp. 325-330,December 2000, and S. A. Zekavat, C. R. Nassar and S. Shattil, “Mergingmulti-carrier CDMA and oscillating-beam smart antenna arrays: Exploitingdirectionality, transmit diversity and frequency diversity,” IEEETransactions on Communications, Vol. 52, No. 1, pp. 110-119, January2004, which are incorporated by reference herein.

In an alternative embodiment of the invention, providing WWAN accessinformation 1140 may include providing WWAN channel-performanceinformation from the WTs to at least one WWAN terminal. Thus, conveyingWWAN information to the WTs 1142 may be performed by at least one WWANterminal. An optional embodiment of the invention may provide for atleast one WWAN terminal determining which WTs in a WLAN group willoperate in a given WWAN link and conveying that WWAN information 1142 tothe WLAN group. Embodiments of the invention may provide capabilities toWWAN terminals to set up and adapt the formation of WLAN groups anddetermine which WTs are assigned to which WLAN groups. Such controlcapabilities may employ GPS positions of WTs to assist in assigning WTsto a WLAN group. Some embodiments of the invention may provide forcollaboration between a WWAN and a WLAN group for activating WTs and/orassigning WTs to the WLAN group.

In one embodiment of the invention, step 1142 may include a preliminarysignal-processing step (not shown) in which at least one WWAN terminalcalculates cooperative-beamforming weights for the WTs based onchannel-performance information provided by the WTs. Accordingly, theWWAN information may include cooperative-beamforming weights derived byat least one WWAN terminal and conveyed to at least one WT.Synchronization 1143 of the transmitted and/or received WWAN signals bythe WTs may optionally be performed by at least one WWAN terminal.Similarly, embodiments of the invention may provide for applyingtime-varying weights to WWAN-terminal transmissions (such as describedpreviously).

FIG. 4D illustrates a functional embodiment of the invention adapted toperform cooperative beamforming. WWAN channel information is provided1144 for assigning subchannels 1145 and calculating cooperativebeamforming (i.e., WT) weights 1146. The beamforming weights are thendistributed to the appropriate WTs 1147.

Sub-channel assignments 1145 are typically performed with respect to apredetermined subchannel-quality threshold, such as SNR, SINR, or BER.Subchannels having the required minimum performance may be assigned fortransmission and/or reception. Sub-channel assignments 1145 may alsoprovide for bit loading. Alternatively, sub-channel assignments 1145 maybe performed without regard to sub-channel quality. In such cases,spreading or channel coding may be performed to mitigate the effects oflost and compromised subchannels.

Weight calculations 1146 may be achieved by either deterministic orblind adaptive techniques. The calculations may be performed by one ormore WTs, or alternatively, by at least one WWAN terminal. Cooperativebeamforming weights may be provided to achieve at least one form ofarray processing benefit, including diversity combining, interferencecancellation, and spatial reuse.

FIG. 5A illustrates a functional embodiment of the invention that may beimplemented by hardware and/or software. A plurality of transmitted WWANsignals are received 1150 by a plurality of WTs. Baseband (or IF) WWANinformation is derived 1151 from the received WWAN signals. For example,in an OFDM system, a baseband WWAN signal s_(k) received by a k^(th) WTcan be represented by a linear superposition of up to M transmitted datasymbols d_(i) {i=1, . . . ,M} weighted by complex channel weightsα_(ik):

$s_{k} = {{\sum\limits_{i = 1}^{M}\;{\alpha_{ik}d_{i}}} + \eta_{k}}$Baseband WWAN signals (which typically include the complex channelweights α_(ik)), are optionally transmitted 1158 into a WLAN fordistribution to one or more other WTs. Accordingly, data (includingbaseband WWAN signals s_(k), complex channel weights α_(ik), and/or MIMOweights β_(il)) from the one or more other WTs is received 1152 from theWLAN. MIMO processing 1153 may be performed to produce at least one setof MIMO weights β_(il) and/or estimated transmitted data symbols d_(i),which may optionally be transmitted 1159 to at least one other WT viathe WLAN. Baseband information recovery 1154 may optionally be performedon the estimated transmitted data symbols d_(i). For example, basebandoperations may include despreading, demodulation, error correction(e.g., channel decoding), demultiplexing, de-interleaving, dataformatting, etc.

FIG. 5B illustrates an alternative functional embodiment of theinvention that may be implemented by hardware and/or software. In thiscase, WWAN baseband information that does not include MIMO weights maybe received 1155 from at least one other WT via the WLAN. Thus, MIMOprocessing 1153 includes generating MIMO weights, which may betransmitted 1159 to one or more WTs via the WLAN. The functionalembodiment illustrated in FIG. 5B is particularly applicable to a WTfunctioning as a computer-processing terminal in a WLAN group. In thecase where the subject WT functions as the only MIMO-processing terminalin a given WLAN group, the functional embodiment may be characterizedsolely by steps 1155, 1153, 1154, and optional step 1159. Furthermore,the functional embodiments described herein may be adapted to performother array-processing operations in addition to, or instead of, MIMO.

FIG. 6A illustrates functional and apparatus embodiments of the presentinvention pertaining to one or more WTs, such as WT 1109. In particular,a WWAN interface 1161 may be coupled to a beam-forming system 1162,which is coupled to a WLAN interface 1163. The beam-forming system 1162may employ data received from the WLAN interface 1163 (and optionally,from data received from the WWAN interface 1161) to perform beam-formingoperations. The WLAN interface 1163 is adapted to provide WLAN datacommunications with at least one other WT (not shown). The beam-formingsystem 1162 may be adapted to provide either or both WWAN transmissionbeam-forming and reception beam-forming operations.

FIG. 6B illustrates a preferred embodiment of the invention that may beemployed as either or both apparatus and functional embodiments. A WWANinterface 1161 includes an RF front-end 1611, a DAC/ADC module 1612, apulse-shaping filter 1613, a modulator/demodulator module 1614, anequalizer modulator 1615 that optionally employs pre-equalization means,a multiplexer/demultiplexer module 1616, and a baseband-processingmodule 1617. The WWAN interface may also include a network-controlmodule 1618 that may be responsive to both WWAN control signaling andWLAN-control signals configured to convey WWAN control information tothe WWAN interface 1161.

A WLAN interface 1163 includes an RF front-end 1631, a DAC/ADC module1632, a pulse-shaping filter 1633, a modulator/demodulator module 1634,an equalizer modulator 1635 that optionally employs pre-equalizationmeans, a multiplexer/demultiplexer module 1636, and abaseband-processing module 1637. A beam-forming module 1162 is adaptedto process signals from either or both baseband modules 1617 and 1637.The beam-forming module 1162 may be adapted to process local datasymbols generated by a local data source 1160.

As described previously, the beam-forming module 1162 may be adapted toperform beam-forming operations on baseband WWAN signals received fromeither or both the WWAN interface 1161 and the WLAN interface 1163.Specifically, the beam-forming module 1162 may be adapted to performbeam forming by utilizing baseband WWAN signals, channel weights (orother channel-characterization information), beam-forming weights (suchas MIMO weights), and/or baseband data symbols. Baseband data symbolsmay be received from the local data source 1160, from local data sourceson other WTs, and/or from estimated data generated by one or moreexternal beam-forming modules (e.g., beam-forming modules on other WTs).Optionally, the beam-forming module 1162 may be configured to adjustequalization and/or pre-equalization 1615.

In an exemplary embodiment of the invention, the beam-forming module1162 is configured to process baseband WWAN signals received from thebaseband-processing module 1617 and the WLAN interface 1163. Informationoutput from the beam-forming module 1162 is conveyed to at least one ofthe WLAN interface 1163 and a local data sink 1169. Estimated WWAN datasymbols output by the beam-forming module 1162 may optionally beprocessed by the baseband-processing module 1617 or the local data sink1169. For example, the baseband-processing module 1617 may be configuredto perform various types of signal processing, including errorcorrection (such as Viterbi decoding), constellation mapping, and dataformatting on data output by the beam-forming module 1162. The resultingprocessed data may then be coupled to the local data sink 1169 and/orthe WLAN interface 1163. Alternatively, the local data sink 1169 mayperform the previously described signal-processing types.

Beam forming is performed cooperatively with other WTs to providepredetermined WWAN spatial processing for transmitted and/or receivedWWAN signals. Thus, a network-function adapter 1165 may be employed toprovide WWAN channel-access information to one or more WTs. For example,some embodiments of the invention require multiple WTs to function as asingle WT. In this case, each WT is provided with WWAN-accessinformation corresponding to the single WT it is configured to spoof.The network function adapter 1165 may be configured to generateWWAN-access information to be distributed to at least one other WTand/or it may be configured to receive WWAN-access information from theWLAN interface 1163 and convey it to the network-control module 1618 inthe WWAN interface 1161.

WWAN-access information typically includes channelization (or some otherform of multiple access) information used to transmit and/or receivedata from the WWAN. For example, WWAN-access information may take theform of user identification sequences, assigned time slots, frequencyband assignments, and/or multiple-access code assignment.

In some embodiments of the invention, a particular WT may be required tofunction as multiple WTs. In this case, WWAN-access information isconveyed to the network-control module 1618 and data is configured to beappropriately multiplexed and/or demultiplexed relative to a pluralityof multiple-access channels.

The network-function adapter 1165 may be used to convey other WWANcontrol information to WTs, including (but not limited to) power-controlcommands, timing and synchronization information, key-exchange messages,WWAN routing tables, acknowledgements, requests for retransmission,probing signals, and paging messages. The network-function adapted 1165may be configured to alter or adapt the WWAN-control information that itreceives from either or both the WWAN interface 1161 and the WLANinterface 1163. For example, WWAN power-control commands received by oneor more WTs may be adapted by the network-function adapter 1165 prior tobeing conveyed to network-control modules (such as network-controlmodule 1618) on multiple WTs. Power control may be adapted by one ormore network-function adapters 1165 for particular WTs depending ontheir WWAN channel quality and power. Alternatively, thenetwork-function adapter 1165 may adapt the number M of WTs servicing agiven link in response to WWAN control information.

In some embodiments of the invention, it may be advantageous to employ asingle decision system for network-function adaptation 1165. In one modeof operation, the network-function adapter 1165 of only one of aplurality of WTs assigned to a particular WWAN channel is adapted toconvey WWAN control information to the other WTs. In each of the otherWTs, the associated network-function adapter 1165 identifies the WWANcontrol information received from the WLAN and couples it to thenetwork-control module 1618. Thus, the network-function adapter 1165 mayinstruct the network-control module 1618 to disregard one or more typesof WWAN control information received from the WWAN interface 1161. Oneor more network-function adapters (such as network-function adapter1165) may synchronize WT responses to WWAN control information.

In another embodiment of the invention, each WT may be responsive toWWAN control information that it receives. In yet another embodiment,each of a plurality of WWAN multiple-access channels is preferablycontrolled by a separate network-function adapter 1165. These and otheradaptations and permutations of network function may be embodied byfunctional aspects of the network-function adapter 1165.

One embodiment of the invention employs the functionality of a group ofWTs corresponding to FIG. 1C with respect to the transceiver embodimentshown in FIG. 6B. In a transmission configuration, a serial data streams(n) from the local data source 1160 of a particular WT is channel codedto produce coded data stream u(n), which is grouped in blocks of size N:u(i)=[u(iN), u(iN+1), . . . , u(iN+N−1)]^(T). In this case, Nis chosento equal the number M of WTs employed as antenna elements. The N−1 codeddata symbols u(n) are distributed to the other N−1 WTs via the WLANinterface 1163.

At each WT's Mux/DeMux block 1615, a particular data symbol u(n) ismapped into a frequency bin vector. In one aspect of the invention, eachdata symbol u(n) is provided with both a unique frequency bin and aunique WT, such as to achieve optimal diversity benefits. This takes theform of a frequency-bin vector having all zeros except for one bincorresponding to u(n). This scheme can be used to achieve lowtransmitted PAPR, as well as other benefits. In other embodiments,alternative WT/frequency-bin combinations may be employed. For example,multiple serial data streams s(n) may be provided to the frequency-binvector. Redundant symbols may be provided.

Alternatively, the data s(n) may be spread across frequencies and/orWTs.

At each Mod/DeMod block 1614, an IFFT is applied to each data block toproduce:u(i)=F ^(H) u(i)where F is the N×N FFT matrix with F_(nm)=N^(−1/2) exp(−j2πnm/N). Acyclic prefix of length N_(CP) may be inserted in ũ(i) to produceũ_(CP)(i)=βT_(CP)ũ(i), which has length N_(T)=N+N_(CP). The termT_(CP)=[I_(CP) ^(T)I_(N) ^(T)]^(T) represents the cyclic prefixinsertion in which the last N_(CP) rows of the N×N identity matrix I_(N)(denoted by I_(CP)) are concatenated with identity matrix I_(N). Theterm β is the power loss factor, β=N/N_(T) .

The block ũ_(CP)(i) is serialized to yield ũ_(CP)(n), which is thenpulse shaped 1613, carrier modulated 1612, amplified, and transmitted1611 via multiple antenna elements through a channel. The channelimpulse response h(n) includes the effects of pulse shaping, channeleffects, receiver filtering, and sampling.

In a receiver configuration of the invention, each of a plurality of WTsis adapted to receive a different transmitted symbol on a differentorthogonal carrier frequency. For a WT employing a square-root Nyquistreceive filter, the received samples are expressed by:x(n)=ũ _(CP)(n)*h(n)+v(n)where v(n) is additive white Gaussian noise (AWGN). The received samplesare grouped into blocks of size N_(T):x_(CP)(i)=[x(iN_(T)), x(iN_(T)+1),. . . , x(iN_(T)+N_(T)−1)]^(T). The first N_(CP) values of x_(CP)(i)corresponding to the cyclic prefix are discarded, which leaves N-lengthblocks expressed by: x(i)=[x(iN_(T)+N_(CP)), x(iN_(T)+N_(CP)+1), . . . ,x(iN_(T)+N_(T)−1)]^(T). H is defined as an N×N circulant matrix with{tilde over (H)}_(n,m)=h((n−m)_(nod N)). The block input-outputrelationship is expressed as: {tilde over (x)}(i)=β{tilde over(H)}ũ(i)+{tilde over (η)}(i), where {tilde over(η)}(i)=[v(iN_(T)+N_(CP)), v(iN_(T)+N_(CP)+1), . . . ,v(iN_(T)+N_(T)−1)]^(T) is the AWGN block. Applying the FFT to {tildeover (x)}(i) yields:x(i)=F{tilde over (x)}(i)=βF{tilde over (H)}F ^(H) u(i)+{tilde over(η)}(i)=βD _(H) u(i)+η(i)whereD _(H)=diag[H(e ^(j0)),H(e ^(j(2π/N))), . . . H(e^(j(2π(N−1)/N)))]=F{tilde over (H)}F ^(H)and H(e^(j2πf)) is the frequency response of the ISI channel;

${H\left( e^{j\; 2\pi\; f} \right)} = {\sum\limits_{n = 0}^{N_{CP}}\;{{h(n)}{e^{{- j}\; 2\pi\;{fn}}.}}}$An equalizer followed by a decoder uses x(i) to estimate the datasymbols encoded on u(i).

Preferred embodiment of the invention may employ Spread-OFDM, whichinvolves multiplying each data block s(n) by a spreading matrix A:u(n)=As(n)In the case where CI spreading codes are employed, A_(nm)=exp(−j2πnm/N).This maps the data symbols to pulse waveforms positioned orthogonally intime. This choice of spreading codes also gives the appearance ofreversing the IFFT. However, the resulting set of pulse waveforms is ablock, rather than a sequence, wherein each waveform represents a cyclicshift within the block duration T_(s), such as described in U.S. Pat.Appl. Pubs. 20030147655 and 20040086027, which are both incorporated byreference.

FIG. 7A illustrates a functional embodiment of the invention related tocalculating MIMO weights in a cooperative-beamforming network. Aplurality of WTs provide received baseband information from a WWANchannel 1701 that includes a training sequence and/or a data sequencehaving a predetermined constellation of values. WWAN MIMO processing isperformed 1702 on the received baseband information to derive aplurality of array-processing weights β_(i), which are then distributed1703 via the WLAN to a predetermined plurality of WTs.

FIG. 7B illustrates a functional embodiment of the invention adapted tocalculate transmitted data symbols received by a cooperative-beamformingnetwork. A plurality of WTs provide received baseband information from aWWAN channel 1701 that includes a data sequence having a predeterminedconstellation of values. WWAN MIMO processing may be performed 1704 onthe received baseband information to derive a plurality of estimateddata symbols d_(i), which are then conveyed 1705 via the WLAN to atleast one destination WT. The WWAN MIMO processing 1704 may optionallyinclude providing for any of a set of signal-processing operations,including filtering, demodulation, demultiplexing, error correction, anddata formatting.

FIG. 8A illustrates a functional embodiment for a method and apparatusof the invention. Specifically, a data source 1800 is adapted todistribute a plurality of data symbols via a WLAN channel 199 to aplurality N_(t) of WTs 1806.1-1806.N_(t), which are adapted to transmitthe data symbols into at least one WWAN channel 99. Although thefunctional embodiment shown in FIG. 8A is illustrated with respect touplink WWAN functionality, the functional blocks may alternatively beinverted to provide for downlink WWAN functionality.

The data source and the WTs 1806.1-1806.N_(t) include appropriateWLAN-interface equipment to support distribution of the data symbols tothe WTs 1806.1-1806.N_(t). For example, the WTs 1806.1-1806.N_(t) areshown including WLAN-interface modules 1801.1-1801.N_(t). The WLANchannel 199 may optionally include additional network devices that arenot shown, such as routers, access points, bridges, switches, relays,gateways, and the like. Similarly, the data source 1800 and/or the WTs1806.1-1806.N_(t) may include one or more said additional networkdevices. The data source 1800 may include at least one of the WTs1806.1-1806.N_(t).

A coder 1803.1-1803.N_(t) in each of the WTs 1806.1-1806.N_(t) isadapted to receive a baseband data sequence from the associatedWLAN-interface module 1801.1-1801.N_(t) and provide coding, such aschannel coding, spreading, and/or multiple-access coding. A coded datasequence output from each coder 1803.1-1803.N_(t) is mapped intofrequency bins of multicarrier generators, such as IDFTs1804.1-1804N_(t). This embodiment may be employed to producemulticarrier signals or to synthesis single-carrier signals from aplurality of spectral components. Alternatively, other types ofmulticarrier generators may be employed, such as quadrature-mirrorfilters or DSPs configured to perform other transform operations,including Hadamard transforms. The resulting multicarrier signals arecoupled into the WWAN channel 99 by associated WWAN-interface modules1805.1-1805.N_(t).

For each flat-fading subcarrier frequency channel, the WWAN channel maybe characterized by channel responses 1890.1-1890-N_(t) and1899.1-1899-N_(t) of a mixing system. The channel responses1890.1-1890-N_(t) and 1899.1-1899-N_(t) represent elements of H, anN_(r)×N_(t) channel-response matrix that characterizes the complex gains(i.e., transfer function, or spatial gain distribution) from the N_(t)transmission elements to the N_(r) receive elements; and n_(i)(n)represents an AWGN contribution having zero mean and zero variance.

There are N_(r) receiver elements comprising WWAN-interface modules1815.1-1815.N_(r) and filter banks, such as DFTs 1814.1-1814.N_(r),coupled to at least one MIMO combiner 1810. The MIMO combiner 1810 isadapted to perform any number of signal-processing operations, includingdecoding received data symbols. In one embodiment of the invention, theMIMO combiner 1810 is adapted to perform diversity combining. In anotherembodiment of the invention, the MIMO combiner 1810 is adapted toperform spatial (e.g., sub-space) processing. Furthermore, many otherapplications and embodiments of the invention may be achieved using thefunctional description (or minor variations thereof) depicted in FIG.8A.

FIG. 8B illustrates a functional embodiment of the invention that may beincorporated into specific apparatus and method embodiments. Inparticular, WWAN signals received from a WWAN channel 99 by a pluralityN_(r) of WTs 1836.1-1836.N_(r) are conveyed via a WLAN channel 199 to aMIMO combiner 1830.

In this case, WWAN data symbols are encoded by one or more coders (suchas coders 1821.1-1821.N_(t)), impressed on a plurality of subcarriers byIDFTs 1822.1-1822.N_(t), and coupled into the WWAN channel 99 by aplurality of WWAN-interface modules 1825.1-1825.N_(t). Received WWANsignals may be coupled from the WWAN channel 99 by a plurality N_(r) ofWTs 1836.1-1836.N_(r). Each WT 1836.1-1836.N_(r) includes at least oneWWAN-interface module (such as WWAN-interface modules1831.1-1831.N_(r)), a filter bank (such as DFTs 1834.1-1834.N_(r)), anda WLAN-interface module (such as 1835.1-1835.N_(r)).

WWAN signals received by each WT 1836.1-1836.N_(r) are converted to abaseband data sequence, separated into frequency components (by the DFTs1834.1-1834.N_(r)), and then adapted for transmission into the WLANchannel 99. A MIMO combiner 1830 may be configured to receive WLANtransmissions, recover the frequency components, and perform MIMOprocessing to generate estimates of the transmitted WWAN data symbols.The MIMO combiner 1830 and/or the WTs 1836.1-1836.N_(r) may be adaptedto perform decoding. In one embodiment of the invention, the MIMOcombiner 1830 may include one or more of the WTs 1836.1-1836.N_(r).

FIG. 8C illustrates an embodiment of the invention in which WTs1836.1-1836.N_(r) are adapted to perform time-domain (e.g., Rake)processing. Specifically, each WT 1836.1-1836.N_(r) includes a Rakereceiver 1854.1-1854.N_(r). The embodiment illustrated in FIG. 8C isparticularly suited to performing MIMO operations on receiveddirect-sequence signals, such as direct sequence CDMA (DS-CDMA) signals.

Particular embodiments of the invention may be directed towardtransmitting and/or receiving any of the well-known types of spreadsignals. Spread signals include spread-spectrum signals in which atransmitted signal is spread over a frequency band much wider than theminimum bandwidth needed to transmit the information being sent. Spreadspectrum includes direct-sequence modulation commonly used in CDMAsystems (e.g., cdmaOne, cdma2000, 1×RTT, cdma 1×EV-DO, cdma 1×EV-DV,cdma2000 3×, W-CDMA, Broadband CDMA, and GPS), as well asfrequency-domain spreading techniques, such as spread-OFDM,multi-carrier CDMA, and multi-tone CDMA.

In a DS-CDMA system, a k^(th) WWAN transmission signal s^(k)(t) thatincludes N code bits {b^(k)[n]}_(n=1) ^(N) is given by:

${s^{k}(t)} = {\sum\limits_{n = 0}^{N - 1}\;{{b^{k}\lbrack n\rbrack}{g_{T_{b}}\left( {t - {nT}_{b}} \right)}{g_{\tau}(t)}{a^{k}\left( {t - {iT}_{b}} \right)}{\cos\left( {2\pi\; f_{c}t} \right)}}}$where

${{a^{k}(t)} = {\sum\limits_{i = 0}^{G - 1}\;{C_{i}^{k}{g_{T_{c}}\left( {t - {iT}_{c}} \right)}}}},{C_{i}^{k} \in \left\{ {{- 1},1} \right\}}$is the DS spreading signal, G represents processing gain, T_(c) is thechip duration, T_(b) is the bit duration, and g_(T) _(c) (t), g_(T) _(b)(t), and g_(τ)(t) represent the chip, bit, and transmitted pulse shapes,respectively.

A plurality M of WTs linked together by a WLAN comprises elements of anM-element antenna array capable of receiving K≤M transmission channels.In a frequency-selective channel, the received signal at the array is:

${r(t)} = {{\sum\limits_{k = 1}^{K}\;{\sum\limits_{l = 0}^{L^{k} - 1}\;{\sum\limits_{n = 0}^{N - 1}\;{\alpha_{l}^{k}{\overset{\rightarrow}{V}\left( \vartheta_{l}^{k} \right)}{b_{k}\lbrack n\rbrack}{g\left( {t - \tau_{l}^{k} - {nT}_{b}} \right)}{\cos\left( {{2\pi\; f_{c}t} + \varphi_{l}^{k}} \right)}}}}} + {\upsilon(t)}}$where {right arrow over (V)}(ε) is an array-response vector, K is thenumber of received transmission channels, L^(k) is the number ofdistinct fading paths corresponding to the k^(th) user, α_(l) ^(k) isthe fade amplitude associated with path l and user k, φ_(l) ^(k)=U[0,2π]represents the associated fade phase, τ_(l) ^(k) is the path time-delay(which occurs below a predetermined duration threshold T_(max)), andϑ_(l) ^(k) denotes angle of arrival. The array response vector {rightarrow over (V)}(ϑ) is expressed by:{right arrow over (V)}(ϑ)=[1e ^(−2πd) ¹ ^(cos θ/λ) . . . e ^(−2πd)^(M−1) ^(cos θ/λ])where d_(m) is the antenna separation, and λ is the wavelengthcorresponding to carrier frequency f_(c). For a j^(th) user's l^(th)path, the n^(th) bit at the beamformer output is given by:z _(l) ^(j)[n]=W ^(H)(ε_(l) ^(k))∫_(+(n−1)T) _(b) ^(+nT) ^(b)r(t)cos(2πf _(c) t+φ _(l) ^(j))a ^(j)(t−τ _(l) ^(j)−(n−1)T _(b))dtwhere W(ϑ_(l) ^(k)) is the weighting vector of the beamforming system.z_(l) ^(k)[n] can be expressed by four components:z _(l) ^(k)[n]=S _(i) ^(j)[n]+ISI _(i) ^(j)[n]+IXI _(i) ^(j)[n]+υ_(i)^(j)[n]where S is the desired signal, ISI is inter-symbol interference, IXI iscross interference (i.e., multiple-access interference), and ν is theAWGN contribution. These components can be expressed as follows:S _(l) ^(k)[n]=α_(l) ^(j) W ^(H)(ϑ_(l) ^(j)){right arrow over (V)}(ϑ_(l)^(j))b ^(j)[n]G

${{ISI}_{i}^{j}\lbrack n\rbrack} = {\sum\limits_{\underset{h \neq l}{h = 0}}^{L^{k} - 1}\;{\sum\limits_{n = 0}^{N - 1}\;{\alpha_{l}^{k}{W^{H}\left( \vartheta_{h}^{j} \right)}{\overset{\rightarrow}{V}\left( \vartheta_{l}^{k} \right)}{b^{j}\lbrack n\rbrack}{\cos\left( {\varphi_{h}^{j} - \varphi_{l}^{j}} \right)}{R_{jj}\left( {\tau_{h}^{j} - \tau_{l}^{j} - {nT}_{b}} \right)}}}}$

${{IXI}_{i}^{j}\lbrack n\rbrack} = {\sum\limits_{\underset{k \neq j}{k = 1}}^{K}\;{\sum\limits_{\underset{h \neq l}{h = 0}}^{L^{k} - 1}{\sum\limits_{n = 0}^{N - 1}\;{\alpha_{l}^{k}{W^{H}\left( \vartheta_{h}^{k} \right)}{\overset{\rightarrow}{V}\left( \vartheta_{l}^{j} \right)}{b^{j}\lbrack n\rbrack}{\cos\left( {\varphi_{h}^{k} - \varphi_{l}^{j}} \right)}{R_{kj}\left( {\tau_{l}^{j} - \tau_{h}^{k} - {nT}_{b}} \right)}}}}}$υ_(l) ^(j)[n]=∫^(+(n−1)T) _(b) ^(+nT) ^(b) W ^(H)(ϑ_(l) ^(j))n(t)a^(j)(t−τ _(l) ^(j))cos(2πf _(c) t+φ _(l) ^(j))dt

where W^(H)(ϑ_(l) ^(j)){right arrow over (V)}(ϑ_(l) ^(j)) represents thespatial correlation, φ_(l) ^(j) and τ_(l) ^(j) are the random phase andtime delay for the j^(th) user's l^(th) path, G is the processing gain,and R_(jj) and R_(kj) are the partial auto-correlation andcross-correlation of the direct sequence code(s):R _(kj)(τ)=∫_(τ) ^(T) a ^(k)(t)a ^(j)(t−τ)dtMaximal ratio combining produces an output:

${z^{j}\lbrack n\rbrack} = {\sum\limits_{l = 0}^{L - 1}\;{\alpha_{l}^{j}{z_{l}^{j}\lbrack n\rbrack}}}$which can be processed by a decision processor. In this case, the BER isgiven by:P _(e)=∫0 ^(∞) Q(2r _(o))f(r _(o) |r _(o))dr _(o)where r _(o) is the mean value of the instantaneous SINR, r_(o), and Q() represents the complementary error function.

It should be appreciated that the WTs may be adapted to perform eitheror both time-domain (e.g., Rake) or frequency-domain processing as partof a receiver operation. Signals received by a plurality of WTs may becombined with respect to any combining technique, including EGC, MRC,Minimum Mean Squared Error Combining, other types of optimal combining,Successive Interference Cancellation, and other matrix-reduction/matrixdiagonalization techniques. Array-processing operations may includecombinations of local and global processing. For example, diversitycombining may be performed at each multi-element WT. Then signals fromeach WT may be combined (e.g., in a central processor) to performsub-space (e.g., directional) processing. Other combinations of localand global processing may be employed. Similarly, combinations ofsub-space processing (i.e., capacity enhancement) and diversitycombining (i.e., signal-quality enhancement) may be performed. It shouldalso be appreciated that the WTs may be adapted to perform either orboth time-domain and frequency-domain processing for transmission. Thus,appropriate delays or complex weights may be provided to WTtransmissions to produce a coherent phase front that converges at apredetermined WWAN destination node.

FIG. 9A illustrates an optional transmission embodiment of the presentinvention. That is, method and apparatus configurations can be inferredfrom the following descriptions. A data source 1900 is adapted toprovide data for processing by an array processor, such as MIMOprocessor 1902. Optionally, other types of array processors may beprovided. A physical (e.g., wired) connection 1902 and/or a wirelessconnection 1901 couple the data between the data source 1900 and theMIMO processor 1902. The wireless connection 1901 is enabled by a WLAN1999. The MIMO processor 1902 is adapted to provide MIMO processing tothe data, such as providing complex channel weights, providing spreadingweights, and/or providing channel coding.

In one exemplary embodiment of the invention, MIMO processor 1902provides convolutional or block channel coding to the data, whicheffectively spreads each data bit over multiple coded data bits. Theresulting coded data bits are then grouped in serial blocks by the MIMOprocessor 1902. Signal-block outputs from the MIMO processor 1902 areprovided with serial-to-parallel conversion by the WLAN 1999 (which isdenoted by S/P 1914) and distributed to a plurality of WTs1906.1-1906.M.

Each WT 1906.1-1906.M has a WLAN interface 1907.1-1907.M adapted toreceive and demodulate the data received from the MIMO processor 1902.The MIMO processor 1902 is accordingly equipped with a WLAN interfacethat is not shown. The MIMO processor 1902 is typically comprised of oneor more WTs 1906.1-1906.M. In some embodiments of the invention, MIMOprocessor 1902 may include at least one computer-processing terminalthat does have a WWAN interface.

Data received from the MIMO processor 1902 is then modulated1908.1-1908.M by each WT 1906.1-1906.M for transmission into a WWANchannel by a corresponding WWAN interface 1909.1-1909.M. Modulation1908.1-1908.M typically includes mapping blocks of data bits to datasymbols, which are then mapped to a modulation constellation. Modulation1908.1-1908.M may also include channel coding and/or data interleaving.In an exemplary embodiment of the invention, modulation 1908.1-1908.Mincludes the application of complex WWAN channel weights. Such channelweights may optionally be provided by the MIMO processor 1902. Inalternative embodiment of the invention, modulators 1908.1-1908.Mprovide a predetermined delay profile (provided by the MIMO processor1902) to the data to be transmitted into the WWAN channel.

FIG. 9B illustrates a functional flow chart that pertains to transmitterapparatus and method embodiments of the invention. One or more datasources 1920.1-1920.K are coupled via a WLAN 1999 to a plurality M ofWTs 1926.1-1926.M. Each WT 1926.1-1926.M includes a WLAN interface1927.1-1927.M, an array processor (such as a MIMO processor1926.1-1926.M), and a WWAN interface 1929.1-1929.M.

The data sources 1920.1-1920.K optionally include baseband-processingcapabilities, such as channel coding, interleaving, spreading,multiplexing, multiple-access processing, etc. The data sources1920.1-1920.K include WLAN interfaces (not shown). The data sources1920.1-1920.K may include one or more WTs 1926.1-1926.M.

The WLAN interfaces 1927.1-1927.M include apparatus and means forconverting received signals that were formatted for transmission in theWLAN 1999 into baseband data signals. The MIMO processors 1926.1-1926.Mare adapted to provide for frequency-domain and/or time-domain MIMOoperations on the baseband data signals received from the WLANinterfaces 1927.1-1927.M. Alternatively, the MIMO processors1926.1-1926.M may be adapted to perform phase operations at WWAN carrierfrequencies transmitted by the WWAN interfaces 1929.1-1929.M. The WWANinterfaces 1929.1-1929.M provide any necessary baseband, IF, and RFoperations necessary for transmitting data in a WWAN channel.

FIG. 10A illustrates software components of a transmission embodiment ofthe invention residing on a computer-readable memory 1950. Anarray-processing weighting source-code segment 1951 is adapted togenerate a plurality of array-element weights for an antenna arraycomprised of a plurality of WTs coupled to at least one WWAN. Thearray-element weights may include at least one of frequency-domainweights (e.g., complex sub-carrier weights) and time-domain weights(e.g., weighted Rake taps). The array-processing weighting source-codesegment 1951 is adapted to accept as input at least one of a set ofinformation inputs, including data signals for transmission into theWWAN, training signals (e.g., known transmission symbols) received fromthe WWAN, data signals (e.g., unknown transmission symbols) receivedfrom the WWAN, WWAN channel estimates, and WWAN-control information.

The array-processing weighting source-code segment 1951 is adapted toprovide as output at least one of a set of information signals,including WWAN weights and weighted data for transmission into the WWAN(i.e., weighted WWAN data). A WLAN distribution source code segment 1952is provided for distributing either or both WWAN weights and weightedWWAN data received from source-code segment 1951 to a plurality of WTsvia at least one WLAN. The WLAN distribution source code segment 1952may optionally function to couple at least one of a set of informationinputs to the source-code segment 1951, including data signals fortransmission into the WWAN (such as generated by other WTs), trainingsignals received from the WWAN, data signals received from the WWAN,WWAN channel estimates, and WWAN-control information.

FIG. 10B illustrates software components of a receiver embodiment of theinvention residing on a computer-readable memory 1960. Anarray-processing weighting source-code segment 1961 is adapted togenerate a plurality of array-element weights for an antenna arraycomprised of a plurality of WTs coupled to at least one WWAN. Thearray-element weights may include at least one of frequency-domainweights (e.g., complex sub-carrier weights) and time-domain weights(e.g., weighted Rake taps). The array-processing weighting source-codesegment 1961 is adapted to accept as input at least one of a set ofinformation inputs, including training signals (e.g., known transmissionsymbols) received from the WWAN, data signals (e.g., unknowntransmission symbols) received from the WWAN, WWAN channel estimates,and WWAN-control information.

The array-processing weighting source-code segment 1961 is adapted toprovide as output at least one of a set of information signals,including WWAN weights, weighted received WWAN data for transmissioninto the WLAN (i.e., weighted received WWAN data), weighted WWAN datareceived from a plurality of WTs connected by the WLAN and then combined(i.e., combined weighted WWAN data), and estimates of said combinedweighted WWAN data. A WLAN distribution source code segment 1962 isprovided for distributing at least one of a set of signals (includingthe WWAN weights, the weighted received WWAN data, the combined weightedWWAN data, and the estimates said combined weighted WWAN data) to aplurality of WTs via at least one WLAN. The WLAN distribution sourcecode segment 1962 may optionally function to couple at least one of aset of information inputs to the source-code segment 1961, includingWWAN data signals received by other WTs, training signals received fromthe WWAN by other WTs, WWAN channel estimates (either of both locallygenerated and received from other WTs), WWAN-control information,weights received from at least one other WT, and weighted WWAN datareceived from at least one other WT.

Since software embodiments of the invention may reside on one or morecomputer-readable memories, the term computer-readable memory is meantto include more than one memory residing on more than one WT. Thus,embodiments of the invention may employ one or moredistributed-computing methods. In one embodiment of the invention, thecomputer-readable memory 1950 and/or 1960 further includes adistributed-computing source-code segment (not shown). It will beappreciated that many different types of distributed computing, whichare well known in the art, may be performed. The WLAN distributionsource code segment 1952 and/or 1962 may be adapted to provide forsynchronizing transmitted and/or received WWAN signals.

Embodiments of the invention described herein disclose array-processingmethods (including software implementations) and apparatus embodimentsemployed in a WWAN and coordinated between a plurality of WTs connectedvia at least one WWAN. WTs in a WLAN group typically share the same WWANaccess. However, some embodiments of the invention provide for WTs withaccess to different WWANs. Furthermore, one or more WTs may have accessto a plurality of WWANs and WWAN services. In some cases, one or moreWTs may not be configured to access any WWAN.

In some embodiments of the invention, the computer-readable memory 1950and/or 1960 further includes a WLAN setup source-code segment (notshown) capable of establishing and/or dynamically reconfiguring at leastone WLAN group. For example, WTs may convey location information (e.g.,GPS) and/or signal-strength information (e.g., in response to a WLANprobing signal) to the WLAN setup source-code segment (not shown). TheWLAN setup source-code segment (not shown) may reside on one or more ofthe WTs and/or at least one WWAN terminal, such as a cellular basestation.

The WLAN setup source-code segment (not shown) may provide one or moreWLAN group configuration functions, including determining the number ofWWAN-enabled WTs, the total number of WTs in the WLAN group, which WTsare active (and inactive), which WTs are in the WLAN group, andselecting which WT(s) has (have) network-control functionality. The WLANsetup source-code segment (not shown) may be adapted to perform WWANchannel quality analysis functions, including determining WWAN linkperformance (relative to one or more WTs) from training sequences orpilot signals, performing WWAN-channel estimation, receiving linkperformance or channel estimates from the WWAN, and performingchannel-quality calculations (e.g., SNR, BER, PER, etc.).

The WLAN setup source-code segment (not shown) may select which WTs areWWAN-enabled based on one or more criteria points, including WWAN linkperformance, WLAN link performance, required transmission and/orreception needs (e.g., the number of WLAN-group WTs requesting WWANservices, the types of WWAN services required, individual and totalthroughput, required signal-quality threshold, and WWAN bandwidthavailable to the WLAN group), computational load, WLAN capacity,power-consumption load, diversity gain, and interference mitigation.

The WLAN distribution source code segments 1952 and 1962 may be adaptedto route WWAN channel-access information to the WTs. For example, WWANchannel-access information can include multiple-access information(e.g., multiple-access codes, frequency bands, time slots, spatial (orsub-space) channels, etc.), power control commands, timing andsynchronization information, channel coding, modulation, channelpre-coding, and/or spread-spectrum coding.

FIG. 11 shows a WWAN comprising a WWAN access point (e.g., a basestation) 2120 and a local group 2100 comprising a plurality of wirelessterminals (WTs) 2101-2104 communicatively coupled together via a WLAN2105. A network-management operator 2106 is configured to handleWWAN-control operations within the local group 2100. In an exemplaryembodiment, the network-management operator 2106 is coupled to at leastone of the WTs 2101-2104 (e.g., WT 2103). One or more of the WTs2101-2104 may be configured to transmit and/or receive WWANcommunication signals, such as WWAN traffic channels 2110 and WWANcontrol messages 2111. Signals in the WWAN traffic channels 2110 may beprocessed by one or more of the WTs 2101-2104, which may include atleast one local area network controller (e.g., 2103). The WWAN controlmessages 2111 are processed by the network-management operator 2106.

In an exemplary embodiment of the invention, a target WT (e.g., WT 2104)communicates with one or more WTs in the local group 2100 via the WLAN2105, and the local group 2100 is configured to communicate with thebase station 2120 via the WWAN. More specifically, one or more of theWTs 2101-2104 may be configured to participate in WWAN communications atany particular time. The target WT 2104 may communicate with the networkcontroller (e.g., WT 2103), which is configured to communicate withother WTs in the local group 2100. The network controller 2103 typicallyoversees network control functions in the local area network.Alternatively, the target WT 2104 may function as a local area networkcontroller. A particular WT may determine which WTs to use fortransmitting and/or receiving signals in the WWAN based on local areanetwork criteria, as well as WWAN-related criteria. Local area networkcontrol and/or WWAN control functionality may be distributed between oneor more WTs in the local group.

In FIG. 12, a communication system comprises a plurality M of WTs2209.1-2209.M communicatively coupled together in a WLAN, whichcomprises a WLAN controller 2206. A WWAN network-management operator2210 is communicatively coupled to the WLAN controller 2206. WWANnetwork-management operator 2210 is configured for cooperativelyprocessing WWAN-control messages for the WTs 2209.1-2209.M, each ofwhich comprises at least one WWAN interface 2201.1-2201.M, respectively.

According to one aspect of the invention, the WWAN interfaces2201.1-2201.M receive WWAN control messages from the WLAN that wereprocessed by the WWAN network-management operator 2210 and transmitthose messages into the WWAN. According to another aspect of theinvention, the WWAN interfaces 2201.1-2201.M receive WWAN controlmessages from the WWAN and couple those messages through the WLAN to theWWAN network-management operator 2210. According to yet another aspectof the invention, one or more WTs functions as the WWANnetwork-management operator 2210. Thus, the WWAN network-managementoperator 2210 may comprise one or more WWAN interfaces and be configuredto transmit WWAN control messages into the WWAN.

For the purpose of the present disclosure, a WWAN comprising a pluralityof wireless terminals communicatively coupled together via a WLAN may bedefined as one or more of the following system configurations:

-   -   A plurality of WTs in a local group configured to receive from a        base station a signal intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        base station a plurality of signals modulated on interfering        (e.g., common) channels and intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        base station a plurality of signals modulated on different        non-interfering channels and intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        plurality of base stations a signal modulated on a common        channel intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        plurality of base stations a signal redundantly modulated on a        plurality of different channels intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        plurality of base stations a plurality of signals modulated on        interfering channels and intended for at least one WT.    -   A plurality of WTs in a local group configured to receive from a        plurality of base stations a plurality of signals modulated on        different non-interfering channels and intended for at least one        WT.    -   A plurality of WTs in a local group configured to transmit to a        base station a signal originating from at least one WT.    -   A plurality of WTs in a local group configured to transmit to a        base station a plurality of signals modulated on interfering        (e.g., common) channels originating from at least one WT.    -   A plurality of WTs in a local group configured to transmit to a        base station a plurality of signals modulated on different        non-interfering channels originating from at least one WT.    -   A plurality of WTs in a local group configured to transmit to a        plurality of base stations a signal modulated on a common        channel originating from at least one WT.    -   A plurality of WTs in a local group configured to transmit to a        plurality of base stations a signal redundantly modulated on a        plurality of different channels originating from at least one        WT.    -   A plurality of WTs in a local group configured to transmit to a        plurality of base stations a plurality of signals modulated on        interfering channels originating from at least one WT.    -   A plurality of WTs in a local group configured to transmit to a        plurality of base stations a plurality of signals modulated on        different non-interfering channels and originating from at least        one WT.    -   A plurality of WTs in a first local group configured to receive        from a second local group a signal intended for at least one WT        in the first local group.    -   A plurality of WTs in a first local group configured to receive        from a second local group a plurality of signals modulated on        interfering channels and intended for at least one WT in the        first local group.    -   A plurality of WTs in a first local group configured to receive        from second local group a plurality of signals modulated on        different non-interfering channels and intended for at least one        WT in the first local group.    -   A plurality of WTs in a first local group configured to transmit        to a second local group a signal originating from at least one        WT in the first local group.    -   A plurality of WTs in a first local group configured to transmit        to a second local group a plurality of signals modulated on        interfering channels and originating from at least one WT in the        first local group.    -   A plurality of WTs in a first local group configured to transmit        to a second local group a plurality of signals modulated on        different non-interfering channels and originating from at least        one WT in the first local group.    -   A base station comprising a plurality of WTs in a base station        local group configured to transmit a signal intended for at        least one subscriber WT not in the base station local group.    -   A base station comprising a plurality of WTs in a base station        local group configured to transmit a plurality of signals        modulated on interfering (e.g., common) channels and intended        for at least one subscriber WT not in the base station local        group.    -   A base station comprising a plurality of WTs in a base station        local group configured to transmit a plurality of signals        modulated on different non-interfering channels and intended for        at least one subscriber WT not in the base station local group.    -   Multiple base stations comprising at least one base station        local group configured to transmit a signal modulated on a        common channel intended for at least one WT.    -   Multiple base stations comprising at least one base station        local group configured to transmit to a plurality of WTs a        signal redundantly modulated on a plurality of different        channels intended for at least one WT.    -   Multiple base stations comprising at least one base station        local group configured to transmit to a plurality of WTs a        plurality of signals modulated on interfering channels and        intended for at least one WT.    -   Multiple base stations comprising at least one base station        local group configured to transmit to a plurality of WTs a        plurality of signals modulated on different non-interfering        channels and intended for at least one WT.    -   A base station comprising a plurality of WTs in a base station        local group configured to receive a signal originating from at        least one WT.    -   A base station comprising a plurality of WTs in a base station        local group configured to receive a plurality of signals        originating from at least one WT and modulated on interfering        channels.    -   A base station comprising a plurality of WTs in a base station        local group configured to receive a plurality of signals        modulated on different non-interfering channels and originating        from at least one WT.    -   Multiple base stations comprising at least one base station        local group configured to receive a signal modulated on a common        channel originating from at least one WT.    -   Multiple base stations comprising at least one base station        local group configured to receive a signal redundantly modulated        on a plurality of different channels originating from at least        one WT.    -   Multiple base stations comprising at least one base station        local group configured to receive a plurality of signals        modulated on interfering channels and originating from at least        one WT.    -   Multiple base stations comprising at least one base station        local group configured to receive a plurality of signals        modulated on different non-interfering channels and originating        from at least one WT.

A WWAN network-management operator may include a single WT or aplurality of WTs. In one embodiment, the WWAN network-managementoperator includes a single WT communicatively coupled to the WWAN andconfigured to perform WWAN-control operations for one or more WTs in thelocal group. For example, a block diagram of a WT 2300 shown in FIG. 13comprises a WWAN network-management operator module 2302 communicativelycoupled to a WWAN interface 2301 and a WLAN interface 2303. In anotherembodiment, the WWAN network-management operator may comprise WWANnetwork-management operator modules residing in a plurality of WTs.Thus, the WWAN network-management operator may be configured to transmitand/or receive WWAN-control parameters in the WWAN on behalf of one ormore WTs in the local group. A local area network controller may alsoinclude a WWAN network-management operator module and may perform WWANnetwork management for one or more WTs in the group.

Each WT may function as its own network-management operator. Forexample, a WT functioning as its own network-management operator may becommunicatively coupled to the WWAN and configured to transmit andreceive WWAN control information directly with the WWAN, whereastraffic-channel processing may be performed in cooperation with one ormore other WTs in the local group. In another exemplary configuration,WWAN control information may be coupled from a target WT (e.g., a sourceor destination WT relative to the subject information, i.e., the WWANcontrol information) to a relay WT communicatively coupled to the WWANand configured to transmit and receive the target WT's WWAN controlinformation. While the target WT functions as its own network-managementoperator, it may employ other WTs in the local group to transmit andreceive WWAN control messages. Thus, the relay WT may merely function asa pass through having optional added physical-layer adjustments for theWWAN control information. The physical-layer adjustments may be used tocondition the WWAN control messages for the WWAN channel and/or the WLANchannel. Similarly, a WT functioning as a network-management operatorfor itself and/or at least one other WT may employ one or more WTs inthe local group for transmitting and receiving WWAN control messages inthe WWAN.

In another embodiment, a WT may function as a network-managementoperator for one or more other WTs. For example, a network controllermay function as a network-management operator for at least one other WT.In another embodiment, at least one WT that is neither a networkcontroller nor a target WT may function as the network-managementoperator. For example, a WT having the best WWAN channel (such as may bedetermined by any of a variety of signal quality criteria that are wellknown in the art) may be selected as the network-management operator.Various criteria for selecting WTs for network-management operatorresponsibilities may be implemented, including load balancing.

In another embodiment of the invention, a plurality of WTs in a localgroup may simultaneously function as a network-management operator. Thenetwork-management operator may comprise multiple WTs including a targetWT, multiple WTs including a network controller, multiple WTs notincluding a network controller, or multiple WTs not including a targetWT. A plurality of WTs may redundantly process WWAN control messages.Alternatively, each of a plurality of WTs configured to performWWAN-control operations may be configured to perform a predeterminedsubset of the WWAN-control operations.

A network-management operator may participate in any combination ofvarious WWAN-control operations, including power control, data-ratecontrol, session control, authentication, key exchange, paging,control-channel monitoring, traffic channel request, channel assignment,error detection, acknowledgement, request for retransmission,identification, reconnects, synchronization, flow control, request forservice from a particular sector or access point, hand-off.

FIG. 14 is a flow diagram of a communication method configured inaccordance with an aspect of the invention. A WLAN is employed forsharing WWAN control information between a group of WTs 2401. WWANcontrol information is coordinated between the group of WTs and the WWAN2402, and WWAN control information is cooperatively processed by thegroup 2403.

The Open Systems Interconnection Reference Model (OSI Reference Model)may be used to describe the function of a WWAN comprising a local groupof a plurality of WTs communicatively coupled together via a WLAN.

In the Application Layer, each WT typically employs its own userapplications for accessing network services (e.g., login, data upload,data download, multi-media processing). Thus, each WT handles its ownapplication-layer network access, flow control, and error processing.Each WT controls its own user interface for access to services thatsupport user applications. These applications typically are not subjectto cooperative access (e.g., sharing). However, certain networkresources (e.g., printers, faxes) may be shared. Some applications, suchas computational processing applications, may provide for distributedcomputing processes between WTs in a network. However, suchdistributed-computing applications have not been employed in the priorart for receiving and decoding wireless communications.

In the Presentation Layer, each WT may translate data from anapplication format to a network format and vice-versa. Different dataformats from different applications are processed to produce a commondata format. Each WT may manage its own protocol conversion, characterconversion, data encryption/decryption, and data compression/expansion.Alternatively, a network controller that serves multiple WT may performone or more presentation-layer functions. For example, data-processingintelligence may be handled by a network controller, and individual WTsmay function as dumb terminals. In some multimedia applications, anetwork controller may function essentially as a media server configuredto deliver predetermined data formats to each WT functioning as a mediadevice. Furthermore, there are various degrees of how presentation-layerprocessing may be shared between WTs and a network controller.

In the Session Layer, each WT may be responsible for identification soonly designated parties can participate in a session. Session setup,reconnects, and synchronization processes may be managed by the targetWT (e.g., a subscriber, an access point, or a base station), whichfunctions as its own network-management operator for session-layerprocessing. Alternatively, a network controller may manage session-layeractivities for each of one or more WTs in the local group. The networkcontroller may store identities for each WT and manage sessions and theflow of information for each WT.

In another embodiment, multiple WTs may participate in sessionmanagement. Some centralized decision-processing (such as by the targetWT or a network controller) may be employed to direct one or more WTs toperform specific session-layer activities. Multiple responsibilities maybe divided among the WTs. For example, one WT may conductsynchronization processes and another WT may perform session setup. TheWTs assigned to perform particular functions may change with respect tosignal quality with the WWAN, load balancing criteria, and/or otherconsiderations.

In the Transport Layer, each WT may convert data streams into packets orpredetermined segments. Each WT may also process received packets toreassemble messages. Thus, each WT may perform its own error handling,flow control, acknowledgement, and request for retransmission.

Alternatively, a network controller may manage transport-layeroperations for each of one or more WTs in a local group. The networkcontroller may be configured to convert data streams received from theWTs into packets. Similarly, the WT may convert data packets receivedfrom the WWAN into data streams that are routed to the appropriate WTs.The network controller may perform common network-management operatorfunctions, including error handling, flow control, acknowledgement, andrequest for retransmission for each of the WTs.

In yet another embodiment, multiple WTs may be used to convert datastreams into packets and/or process received packets to reassemblemessages for a particular target WT. Each of a plurality of WTs mayprocess only a portion of the received data stream and perform errorhandling, flow control, acknowledgement, and request for retransmissionfor the data it processes. Alternatively, multiple WTs may handle thesame data. For example, redundant transport-layer processing may beperformed by different WTs having uncorrelated WWAN channels in order toreduce errors, and thus, requests for retransmission. In anotherembodiment, only one WT may handle transport-layer processing at anygiven time. For example, a particular WT may be assigned to handletransport-layer processing if it has favorable WWAN-channel conditions.Other criteria, such as load balancing, may be used to select andtransfer transport-layer processing responsibilities between WTs.

In the Network Layer, WTs may perform their own network-layerprocessing, such as addressing and routing. A WT, such as a router, abase station, a switch, or a relay may perform network-layer processes,including managing data congestion, adjusting data frames, packetswitching, and routing. In addition to managing network-layer controlwithin its local group, a network controller may perform network-layerprocesses for the WWAN.

The Data Link layer includes a Media Access Control (MAC) sub-layer andthe Logical Link Control (LLC) sub-layer. Each WT may perform Data-linkprocessing, such as converting received raw data bits into packets andmanaging error detection for other WTs. Similarly, each WT may convertdata packets into raw data bits for one or more other WTs. In oneembodiment, a target WT may perform its own data-link processing.Alternatively, a network controller may perform data-link processing forone or more WTs.

A Physical layer embodiment may provide for performing allphysical-layer processes by a target WT. For example, a target WTdistributes spread, scrambled baseband data to the other WTs, which thenup convert and transmit the target's transmission signal as specified bythe target WT. Similarly, each WT may receive and down convert WWANtransmissions and direct the down-converted signal via the WLAN forprocessing (e.g., descrambling and despreading) by a target WT.

In one embodiment, physical-layer processes may be divided between atarget WT and other WTs in a local group. For example, the target WT mayconvey baseband data and control parameters to other WTs, which thenspread and scramble the baseband data with respect to the controlparameters. Additional control parameters, such as power control, anddata rate control may be specified. Similarly, WTs in a local group maydescramble and despread received data for further processing by a targetWT. WTs may monitor control channels for signals addressed to any of aplurality of WTs in a local group.

In yet another embodiment, a network controller may perform some or allphysical-layer processes corresponding to a target WT. A networkcontroller may perform all physical-layer processes for a target WT (andother WTs in the corresponding local group if it performs higher-layerprocesses for the target WT). Alternatively, some of the higher-layerprocesses may be performed by the network controller and/or other WTs aspart of a distributed computing procedure regardless of how thephysical-layer processes are performed.

Several aspects of physical-layer processing include WWAN-controloperations. Other WWAN-control operations may fall within any of aplurality of the OSI reference model layers. Embodiments andinterpretations of the invention should not be constrained to thelimitations of the OSI reference model. The OSI reference model is ageneralization that may not be suitable for expressing theimplementation of all WWAN-control operations.

In one aspect of the invention, a cellular base station may transmit aprobe signal (e.g., a predetermined signal that is ramped in signalpower) to a plurality of subscriber WTs. A network-management operatorin a local group of WTs may be responsive to the probe signal forindicating a signal power level capable of being received from the basestation. Similarly, the signal power level may be used as an indicatorfor transmit power and/or data rate.

Functions of the network-management operator may be distributed over aplurality of WTs in the local group, and network-managementresponsibilities may be shared by more than one WT and/or dynamicallyassigned to particular WTs. For example, a WT that first detects theprobe signal may be assigned subsequent network-managementresponsibilities, such as predicting forward-link SINR and an associatedachievable data rate, sending an acknowledgement to the base station, orrequesting a particular data rate (e.g., sending a dynamic rate controlsignal to the base station). In another embodiment of the invention,WWAN signals received by a group of WTs may be combined before beingprocessed by a network-management operator.

In one embodiment of the invention, a network-management operator in alocal group performs open loop estimation to adjust reverse link (i.e.,local group) transmit power. Alternatively, closed-loop powercorrections may involve both the network-management operator and thebase station. The network-management operator may send an access probesequence and wait for an acknowledgement from a base station. Initialprobe power is typically determined via power control.

A WT in the local group is typically denoted as being in an inactivestate relative to the WWAN when it is not assigned a forward trafficchannel. However, the network-management operator may assign one or moreWWAN traffic channels to WTs that the WWAN considers inactive. In suchcases, inactive WTs may help transmit and/or receive WWAN communicationsintended for active WTs in the local group. Similarly, active WTs may beassigned additional traffic channels by the network-management operatorfor transmitting and/or receiving WWAN communications intended for otheractive WTs in the group. Such assignments may be invisible to the WWAN,since so-called inactive WTs are used for connecting active WTs to theWWAN. In other embodiments of the invention, complex assignments,including sharing traffic channels between WTs, may be implemented.

A network-management operator may service one or more WTs in avariable-rate state. For example, a forward traffic channel istransmitted at a variable rate determined by the network-managementoperator's data rate control value. The network-management operator maydetermine the maximum data rate using any of a variety of well-knowntechniques. The network-management operator uses a data rate controlchannel to instruct the WWAN what data rate to serve to a particular WTin the local group. In response, the base station selects modulation,channel coding, power and/or number of multiple-access slots.

The network-management operator may direct its instructions to the bestbase station (i.e., the base station having the best channel relative tothe local group) in its active set via addressing (e.g., a coveringcode). Alternatively, the network-management operator may instructmultiple base stations to serve the local group. This may occur when WTscan access more than one WWAN. This may also occur when some WTs arebetter served by one base station or sector while other WTs in the samelocal group are better served by a different base station or sector.

A WT enters a fixed-rate state when its network-management operatorsignals a request for a specific fixed rate from a base station orsector. The WT may transition to a variable rate if it cannot receivepackets at the previously requested fixed rate. A network-managementoperator may select a fixed rate if there is an imbalance (e.g.,different channel conditions) between the forward and reverse links.

In one aspect of the invention, a network-management operator isconfigured to perform connection-layer protocols that are typicallyconducted between a target WT and the base station. For example, thenetwork-management operator may participate in acquisition andinitialization state protocols, air link management protocols,connection state protocols, route updates, and/or idle state protocols.

A WT in an inactive state typically awakes from a sleep stateperiodically to monitor a control channel to receive overhead parametermessages and paging messages. In one aspect of the invention, anetwork-management operator may wait for an activate command from adefault air link management protocol. A network-management operator maymonitor a WWAN control channel for multiple WTs in a local group. In analternative embodiment, WTs in the local group may take turns monitoringthe WWAN control channel. In this case, responsibilities of thenetwork-management operator are transferred betweens WTs in the localgroup. In another embodiment, a plurality of WTs may monitor the WWANcontrol channel, wherein each WT is configured to monitor the channelfor only a subset of WTs in the local group.

In a network determination state, the network-management operatorselects a channel on which to acquire a base station for a WT in thelocal group. After selecting a channel, the network-management operatorenters a pilot acquisition state in which the network-managementoperator tunes to a particular channel and searches for the strongestpilot signal. Upon acquiring a pilot, the network-management operatorenters a synchronization state. At this point, the network-managementoperator may transfer synchronization responsibilities to the target WT.If the network-management operator (or the target WT) is unable toobtain a pilot, it reverts back to the network determination state.

In the synchronization state, the network-management operator or thetarget WT looks for a sync message on the control channel and sets itsclock to the time specified in the sync message. Failure to receive thesync message or similar failures may result in returning to the networkdetermination state.

The base station undergoes various state transitions in the process ofserving the WTs. In an initialization state, the base station activatesan initialization state protocol, overhead message protocol, and acontrol channel MAC protocol. A network-management operator mayselectively route certain messages through WTs in a local groupcomprising the base station while reserving other messages for WWANtransmission only by the base station.

An idle state occurs after the network is acquired, but before an openconnection is established. The base station initiates an idle stateprotocol, overhead messages protocol, route update protocol, controlchannel MAC protocol, access channel MAC protocol, and forward andreverse channel MAC protocols. In the connected state, base station andthe target WT have an open connection until the connection is closed(i.e., goes to the idle state) or network redirection (goes to theinitialization state). The base station activates a connected stateprotocol, overhead messages protocol, route update, control channel MACprotocol, and forward and reverse channel MAC protocols.

A network-management operator may be configured to direct hand offsbetween WWAN sectors, base stations, and/or networks. In one embodiment,a network-management operator in a local group may measure the SINR oneach pilot in an active set (e.g., a set of base stations that activelyserve the local group) and request data from the sector having thehighest SINR. The network-management operator predicts the SINR for thenext packet and request a higher data rate if it can decode it at thatSINR. The rate request (which may include data rate, format, andmodulation type) is sent by the network-management operator to theappropriate sector using a data rate control channel.

Generally, the network-management operator requests data from only onesector at a time. However, different WTs in a local group serving aparticular target WT may request WWAN channels from multiple sectors ata time on identical or different WWAN channels. The network-managementoperator may coordinate requests for channels from different sectors.Multiple sectors (or base stations) may be configured to serve the sameWWAN channel simultaneously. Alternatively, multiple WWAN channels maybe used to serve one WT in the group. Although the target WT may have abetter connection with a particular base station, the local group as awhole may have a better connection with a different base station. Thus,the network-management operator may dictate that the link be establishedand maintained relative to the group's connection rather than the targetWT's connection.

A base-station scheduler may allocate physical channels for WTs.However, a network-management operator in a local group may providelogical channel assignments to the WTs that are invisible to thephysical channel operation of the WWAN. Multiple WTs in a local groupmay utilize a single WT channel, such as for packet switched datacommunications. Each WT may utilize multiple physical channels, such aswhen higher data rates are required. The network-management operator mayassign logical channels to various physical WWAN channels, and thus,effectively hand off those data channels to other sectors, basestations, or WWAN networks serving those physical WWAN channels.

Data rates requested by WTs may follow a channel fading process, whereinhigher data requests occur when channel conditions are favorable andlower rates are requested as the channel degrades. It is well known thatwhen a base station serves a large number of WTs, that diversity ofmultiple units can mitigate system-wide variations in data rate due tochanging channel conditions. Multi-user diversity teaches that theopportunity for serving good channels increases with the number ofusers, which increases total network throughput.

One embodiment of the invention may provide for a network-managementoperator that dynamically selects one WT in a local group to communicatewith a WWAN at a particular time, even though one or more channels maybe served between the base station and the local group. The selection ofwhich WT in the group communicates with the WWAN may change withchanging channel conditions between the local group and the basestation(s). Thus, the update rate for the dynamic selection may be basedon the rate of change of WWAN channel conditions. This embodiment may beadapted for simultaneous communication by multiple WTs and/or the use ofmultiple base stations and/or WWANs. In another exemplary embodiment,the network-management operator may interleave communications (e.g.,packets) across multiple WWAN channels undergoing uncorrelated channeldistortions. Similarly, a WWAN specifically configured to interact witha local group may interleave messages across multiple WWAN channelstransmitted to the local group. Different WWAN channels may betransmitted and received by one base station or a plurality of basestations. This type of interleaving (at either the local group and thebase station) may be determined by a network-management operator.

In another embodiment, a network-management operator may be configuredto redundantly transmit data symbols over multiple slots or physicalchannels to reduce transmission power or to allocate more power to data.

A network-management operator may employ an authentication protocol toauthenticate traffic between a base station and a MT. For example, anetwork-management operator may identify a particular WT in a localgroup to a base station. The base station may then verify that the WThas a legitimate subscription record with a service provider thatutilizes the WWAN. Upon verification, the base station allows access tothe air interface and the network-management operator (whoseresponsibilities may be transferred to the WT) signs access channelpackets to prove it is the true owner of the session. In one exemplaryembodiment of the invention, the WT and/or the network-managementoperator may use IS-856 Air Interface Authentication.

In one embodiment of the invention, a target WT includes anetwork-management operator that employs other WTs in its local group tointeract with a WWAN. In this case, authentication may be performed onlywith the target WT. In an alternative embodiment, the network-managementoperator resides in at least one other WT, such as a network controller.Thus, authentication may be performed with a network-management operatorin a single terminal that is configured to perform authentication formore than one WT.

A network-management operator may employ a key exchange protocol (e.g.,a Diffie-Hellman algorithm) for exchanging security keys between a WTand a WWAN for authentication and encryption. Typically, there is somepredetermined key exchange algorithm used within a particular WWAN.Public values are exchanged and then messages are exchanged between theWT and the WWAN to indicate that the session keys have been correctlycalculated. The keys may be used by the WT and the WWAN in an encryptionprotocol to encrypt traffic.

In one embodiment of the invention, a network-management operatorresides on a target WT that accesses the WWAN via multiple WTs in alocal group. The network-management operator may be configured toencrypt and decrypt WWAN traffic for the target WT without vitalsecurity information being made available to WTs other than the targetWT. In another embodiment, the network-management operator may reside ina network controller. In this case, the network-management operator maybe configured to engage in security protocols for more than one WT inthe local group. Network-management operators according to variousembodiments of the invention may be configured to participate insecurity protocols used to provide crypto sync, time stamps, and otherelements used in authentication and encryption protocols.

Some aspects provide a multicarrier protocol that controls interferencerelationships between the carriers. This control enables time domainsignal shaping, which provides for low PAPR and adaptability tosingle-carrier waveforms. Disclosed aspects include CarrierInterferometry (CI).

In CI, subcarrier frequencies are selected to provide a predeterminedspectral response. Polyphase codes are applied to each subcarrier tocontrol the time-domain characteristics of the superposition signal, aswell as provide for orthogonality between data symbols and/or users. Inone aspect, a pulse (i.e., a constructive interference resulting from azero-phase relationship between the subcarriers) is generated from asuperposition of the coded signals. Time-offset replicas of the pulseare used to construct waveforms having a predetermined frequency-domainprofile.

An objective may be to enable a communication protocol that providesfrequency-diversity benefits of multicarrier modulation tosingle-carrier systems and provides the low-PAPR benefits ofsingle-carrier modulation to multicarrier communication systems, and theability to provide the benefits of both systems simultaneously.

FIG. 15 illustrates a CI pulse shape characterized by an in-phasealignment (e.g., mode locking) of harmonic subcarriers 1505 at aspecific time ti. A composite signal 1530 results from a superposition(i.e., summation) of the carriers 1505. The composite signal 1530 showsa pulse envelope centered at a predetermined time instant ti. In thecase where there is no amplitude tapering (i.e., a rectangular window)and a plurality N of carriers have a uniform frequency separation fs, acomposite CI signal is:

${e(t)} = {\sum\limits_{n = 1}^{N}\; e^{i{\lbrack{{{({\omega_{c} + {n\;\omega_{s}}})}t} + {n\;{\Delta\phi}}}\rbrack}}}$which is characterized by an envelope-magnitude function:

${{e(t)}} = {\frac{\sin\left( {{N\left( {{\omega_{s}t} + {\Delta\phi}} \right)}/2} \right)}{\sin\left( {\left( {{\omega_{s}t} + {\Delta\phi}} \right)/2} \right)}}$where ω_(c) is related to a carrier frequency f_(c) (or equivalently, anoffset frequency f_(o)=f_(c)) by the relationship ω_(c)=2πf_(c).Similarly, ω_(s) is related to the separation frequency f_(s) by therelationship ω_(s)=2πf_(s).

The phase offsets Δϕ typically correspond to any of N orthogonal timeoffsets corresponding to N orthogonal pulse positions. A k^(th) bit ordata symbol ak in a user's transmission s(t) modulated onto a particularCI pulse, or phase space is expressed as:s _(k)(t)=e(t−kT _(b))where T_(b) is a time offset corresponding to the particular CI pulse.Orthogonal pulses are centered at intervals of T_(b)=T_(s)/N. A burst ofbits or symbols may be transmitted onto a contiguous train of pulses,such as shown in FIG. 16B. In this case, a transmission corresponding toa particular user is characterized by the following relationship:

${s(t)} = {\sum\limits_{k = 1}^{N}\;{a_{k}{e\left( {t - {kT}_{b}} \right)}}}$The time-shifted pulses are orthogonal to each other even though thepulses overlap in time:∫₀ ^(T) ^(s) e(t−kT _(b))e(t−nT _(b))δt(k≠n)

FIG. 16A illustrates an amplitude distribution of the CI carrierscorresponding to the pulse train shown in FIG. 16B. In some applicationsof the invention, carriers may be provided with complex weights togenerate superposition signals corresponding to a predetermined sequenceof code chips or data symbols.

FIG. 17A illustrates individual CI pulses provided with code chips ordata symbols, such as symbols β₀(k) to β₁₄(k). A pulse train 1795 shownin FIG. 17B corresponds to the modulated pulses shown in FIG. 17A.

In time-division multiplexing (e.g., in TDMA), the symbols modulatedonto the pulses are typically data symbols corresponding to a particularuser. In frequency-division multiplexing (e.g., in OFDM), data symbolscorresponding to a particular user are modulated onto a pulse train(such as the pulse train shown in FIG. 16B) constructed from apredetermined set of carrier frequencies allocated to that user. Indirect sequence code division multiplexing (e.g., DS-CDMA) or directsequence spread spectrum, data-bearing code symbols are modulated ontothe pulse train. In coded multicarrier spreading (e.g., MC-CDMA orSpread OFDM), data-bearing code symbols are modulated directly onto thecarriers.

The function e(t) is also characterized by an in-phase carrier componentcos(ω_(c)t) and a quadrature-phase component sin(ω_(c)t). The in-phaseand quadrature-phase components can correspond to N orthogonal pulsepositions (i.e., phase spaces) and N pseudo-orthogonal pulse positions,respectively.

The CI signals are periodic with period T_(s)=1/f_(s) for an odd numberof carriers N and with period 2/f_(s) for an even number of carriers N.In either case, data symbols of duration T_(s) are typically modulatedonto the carriers (or pulses). The main lobe has duration 2/Nf_(s) andeach of the N−2 side lobes has a duration 1/Nf_(s).

In FIG. 16A, 20 carrier frequencies are allocated to a particular userand provided with complex weights to generate a train of CI pulsewaveforms that convey information. FIG. 16B shows 20 pulses orthogonally(and equally) positioned in time corresponding to data transmitted by(or to) that user. Each pulse waveform is a superposition of the 20carriers provided with phases relative to the orthogonal positions intime. Predetermined sets of phase offsets are provided to the carriersto position the pulses orthogonally in time.

The cross correlation between the real parts of the pulse waveforms isillustrated by the following equation:

${R_{k,j}(\tau)} = {\frac{1}{2\; f_{s}}\frac{\sin\left( {2\pi\;{Nf}_{s}{\tau/2}} \right)}{\sin\left( {2\pi\; f_{s}{\tau/2}} \right)}{\cos\left( {\frac{\left( {N - 1} \right)}{2}2\pi\; f_{s}\tau} \right)}}$N equally spaced zeros occur over the time interval T_(s)=1/f_(s) as aresult of the sinc-like term in the cross-correlation equation. Thiscorresponds to each pulse waveform being centered at a particular timeinstant corresponding to a zero crossing (i.e., zero value) of all ofthe other orthogonal pulse waveforms.

The cross-correlation equation expresses the Nyquist zero inter-symbolinterference criteria. The Nyquist zero inter-symbol interferencecriteria requires a waveform to have zero crossings corresponding topositions of the other waveforms.

The spacing of the pulse positions (i.e., time instants) corresponds tozeroes in the cross-correlation function. The pulses are centered atequally spaced time instants k/Nf_(s), where k=0, 1, . . . , N−1, N isthe number of carriers, and f_(s)=1/T_(s) is the frequency separationbetween the carriers. Thus, the time instants are defined by 0, T_(s)/N,. . . , T_(s)(N−1)/N.

CI waveforms may be implemented with contiguous or non-contiguouscarriers. Contiguous carriers are defined as carriers allocated to oneor more users characterized by a frequency separation fs and symbolduration T_(s)=1/f_(s).

In the OFDM implementation of the invention, each user is provided witha unique set of carrier frequencies to eliminate multiple accessinterference (MAI). Similar frequency-division multiplexing may beprovided to other CI-based transmission protocols to reduce or eliminateMAI. The real part of each user's OFDM transmission is expressed by

${s(t)} = {\sum\limits_{k = 1}^{N}\;{\sum\limits_{i = 1}^{N}\;{a_{k}{\cos\left( {{2{\pi\left( {f_{c} + {if}_{s}} \right)}t} + {{mi}\; 2{\pi/N}}} \right)}{g(t)}}}}$where a_(k) is a k^(th) data symbol (preferably a channel-coded datasymbol) that is then spread over the N carriers allocated to the user.Since each data symbol is spread across all of the carriers, the fullfrequency diversity benefits of the channel can be achieved. Timeinterleaving may also be provided.

In one aspect, a received CI-OFDM signal for at least one user isseparated into its orthogonal frequency components. Channel compensation(e.g., equalization) and combining are performed to provide estimates ofthe transmitted symbols. Inter-bit interference may be compensated viaany combination of equalization and multi-user detection.

Carrier mixers or a carrier generator, as described herein, includes anytype of system, method, or combination thereof adapted to perform atleast one of a plurality of functions, including carrier generation,carrier selection, carrier allocation, and modulation. Carrier mixersimply the existence of a carrier generator (e.g., a multicarriergenerator). Thus, carrier mixers and carrier generator can be equivalentterms as used herein. A carrier generator may include a carrier-mixercircuit. A carrier mixer may include any type of mixer, modulator, orequivalent device adapted to provide carrier selection and/ormodulation. Carrier mixers/carrier generators may include localoscillators, harmonic signal generators, digital filters, invertibletransform algorithms, quadratic mirror filters, sine wave look-uptables, etc. Carrier mixers may be interpreted as performingfrequency-domain processes.

Carrier mixers or carrier generators may employ digital signalprocessing systems, such as microprocessors, may be employed.Consequently, Fourier transforms, such as DFT-based systems may beemployed. For example, an IFFT or IDFT may be employed with one or moreweight vectors applied to the frequency bins of the transform. A carriermixer (or carrier generator) may include a weight-vector selectoradapted to select predetermined frequency bins. A weight vector mayinclude zero and non-zero values, such as to provide for carrierselection/allocation. Carrier mixers may include one or morecarrier-allocation circuits. A carrier mixer allocates one or morecarriers to one or more users. A carrier mixer may provide formodulation of data symbols onto the carriers. A carrier mixer mayinclude a plurality of modulators or a modulator adapted to modulate atleast one data symbol onto a plurality of carriers.

In this case, the frequencies of the CI carriers are incrementallyspaced by a shift frequency f_(s). However, non-uniform spacing of thefrequencies may also be used to achieve certain benefits. The carrierfrequencies are typically chosen to be orthogonal to each other:

${\overset{T_{C}}{\int\limits_{0}}{{\cos\left( {{\omega_{i}t} + \phi_{i}} \right)}{\cos\left( {{\omega_{j}t} + \phi_{j}} \right)}{dt}}} = 0$where T_(c) is the chip duration, ω_(i) and ω_(j) are the i^(th) andj^(th) carrier frequencies, and ϕ_(i) and ϕ_(j) are arbitrary phases. Asignal in the j^(th) frequency band does not cause interference in thei^(th) frequency band.

The term carrier, as used herein with respect to a multicarrier signalor system, is equivalent to the terms subcarrier and tone. Orthogonalcarriers may be characterized by constant-frequency carriers withorthogonal frequencies. Alternatively, orthogonal carriers may employdynamically varying carrier frequencies, such as chirped or hoppedcarriers. For example, the frequency separation between a set oforthogonal carriers with dynamic frequencies may be constant or limitedto integer multiples of an orthogonal frequency spacing f_(s).

An input data source includes any input port adapted to receive databits and/or data symbols, such as coded data bits and/or symbols. Aninput data source may include any apparatus and/or algorithm adapted togenerate data, such as coded or uncoded data bits and/or symbols. Aninput data source may include at least one coder and/or codingalgorithm. Channel coding may include any combination of well knownchannel coding techniques, such as trellis, block, convolutional, paritycheck (e.g., Gallagher coding or any other type of low-density paritycheck coding), and iterative soft-decision feedback (e.g., turbo)coding.

The phase of each CI signal is set with respect to at least onepredetermined receiver time interval (i.e., phase space) in which thecarriers constructively combine when received by a CI receiver. A set ofincremental phase offsets e^(inΔϕ) _(k) corresponding to at least onepulse position is applied to the CI carriers by one of a plurality N ofinterval delay (i.e., phase) systems. Each pulse's phase space is a setof carrier phases corresponding to the time instant at which the pulseis centered. Thus, each set of phase offsets maps a data symbol to apulse centered at a particular instant in time.

Interval delay systems, or equivalently, phase-shift systems, includeany type of phase shift module, delay module, temporal mapping module,polyphase code module, polyphase filter, etc., adapted to map datasymbols to pulse positions. A pulse position is an instant in time atwhich a CI pulse is centered. A pulse, as used herein, typically refersto a single-pulse waveform generated from a superposition of selectedcarriers. Pulse waveforms may include a plurality of pulses, such as apulse train. Delay systems are systems, algorithms, and/or devicesadapted to provide time offsets (i.e., phase shifts) to individualcarriers to generate carrier superpositions (pulse waveforms). Delaysystems may provide phase offsets and/or time offsets to carriers and/ordata symbols.

A delay system is typically configured to receive as input at least oneof a data sequence and a set of carriers. The delay system directly mapsdata on modulated carriers to particular instants in time. The delaysystem may align carriers to produce pulse waveforms centered at one ormore time instants and then modulation may be provided to the pulsewaveforms. An interval delay system may include a polyphase coderadapted to provide polyphase codes to data symbols and/or carriers. Adelay system may provide polyphase codes to frequency bins of aninvertible transform, such as an IDFT or IFFT.

Although the apparatus diagrams illustrated herein illustrate thegeneration of CI transmission signals as step-by-step procedures, apreferred embodiment for accomplishing these processes may use digitalsignal-processing techniques, such as Discreet Fourier Transforms. Theorder of some of these processes may be switched. For example,modulation of each carrier by the input data may be the final stepbefore combining.

Disclosed aspects may provide for any of various forms of duplexing,such as frequency division duplexing, code division duplexing, and timedivision duplexing (TDD). TDD allows for a highly efficient andcost-effective architecture, since the same frequency is used for bothtransmission and reception and the channel characteristics in bothdirections are virtually identical. In array-processing applications,the beam-forming weights can be determined from a base station antennaarray for the reverse link and the same weights can be used on theforward link without requiring multiple antennas at the remote unit.This allows the system to deliver the capacity and interferencemitigation benefits of adaptive beam forming for both the uplink and thedownlink while keeping the complexity and cost of the remote unit verylow. Furthermore, the TDD approach eliminates expensive diplexingfilters and permits the use of a single RF chain, further reducingsubscriber-unit costs.

FIG. 18A is a functional diagram of a CI transmitter. An allocation step1814 is performed by carrier mixers, which allocate a plurality ofcarrier frequencies (i.e., tones) to a particular user. A mapping step1816 is performed by phase-shift/delay systems, which map each datasymbol from data source 1812 to a particular pulse position. Apulse-generation step 1820′ is performed by a combiner, which receivesthe allocated carriers as inputs and generates CI pulses atpredetermined pulse positions. The resulting data-bearing CI waveformmay be an analog or digital signal. If it is an analog signal, thewaveform may optionally be sampled 1821.

The plurality of carrier mixers performs the allocation step thatprovides carrier frequencies used to generate at least one superpositionsignal for a particular user. The plurality of phase-shift/delay systemsprovides the mapping 1816 of each data symbol from the data source to apredetermined instant in time (i.e., pulse position). Each set of phaseshifts applied to the information-modulated carriers by thephase-shift/delay system produces a phase alignment of the carriers(i.e., an interference pulse) at the predetermined instant in time.Thus, the combination of the phase-shift/delay systems and the datasource produces a discrete signal of the mapped data symbols. The datasymbols are typically provided with polyphase codes and modulated ontothe individual CI carriers. Each polyphase code maps its associated datasymbol to a particular instant in time.

A combining system, or combiner, as described herein, is any system,device or algorithm adapted to combine a plurality of allocated carriers(for transmission or reception) to produce a time-domain waveform. Acombiner may be interpreted as a frequency-domain to time-domainconverter. A combiner may be referred to as an interpolation circuitbecause it generates a time-domain waveform from a plurality offrequency-domain components. A combiner may include an inverse-Fouriertransform, such as an IDFT or IFFT circuit or algorithm. Thus, one wayto implement carrier generation and combining is to provide an IDFT.Consequently, carrier selection and data-symbol mapping may be performedby a polyphase coder adapted to generate a vector of frequency-binweights.

The combining system (which may equivalently be an interpolationcircuit) is adapted to perform pulse generation, as it combines thephase shifted carriers to produce one or more information-modulatedpulses centered at the predetermined instants in time. A plurality ofinformation-modulated pulses may be positioned contiguously in time(such as shown in FIGS. 16B and 17B) to provide a substantially uniform(low PAPR) signal over a predetermined interval (e.g., symbol period Tsor some multiple thereof). The pulse waveforms are functions that spanthe symbol duration Ts. In this case, a pulse waveform may be a digitalor analog signal. The frequency response of the pulses includessinusoids provided by the carrier mixers (i.e., allocation circuit).

FIG. 18B illustrates a CI transmitter that includes a subcarrierallocation module 1814, a mapping module 1816, and an interpolationmodule 1820. The subcarrier allocation module 1816 performs the functionof carrier mixers. Subcarrier allocation assigns a predetermined numberN of carriers to one or more users wherein the carrier frequency spacingf_(s) and data symbol period T_(s) are selected to ensure orthogonalitybetween the carriers. Orthogonality may be provided between theallocated carriers and unallocated carriers (e.g., carriers assigned toother users). For a number N of carriers, there are N orthogonal phasespaces (i.e., pulse positions). Thus, the number of users in anorthogonal CI system is less than or equal to the number N of carriers.

The carriers corresponding to each user may include contiguous carrierfrequencies or uniformly spaced frequencies distributed over a broadfrequency band. Each user may be allocated a unique set of carriers,thus providing for orthogonal frequency division multiple access.Alternatively, two or more users may share at least one set of carrierfrequencies. Thus, CI may employ other multiple-access schemes,including time division and code division.

The mapping module 1816 is equivalently a multicarrier phase-shiftmodule. The mapping module 1816 maps each data symbol from a data sourceto a predetermined instant in time. Incremental phase offsets applied toa plurality of carriers are equivalent to a time offset (e.g., delay)applied to a superposition of the carriers. Each set of phase offsetsproduces a phase alignment of the carriers (i.e., an interference pulse)at a predetermined instant in time, thus, mapping each data symbol to aninstant in time.

The carriers are provided by the subcarrier allocation module 1814(e.g., a plurality of carrier mixers) and modulated with one or moredata symbols. Modulation may be performed at the carrier mixers. Thecombination of the phase-shift/delay systems and the data sourceproduces a discrete signal consisting of the mapped data symbols.

The interpolation module 1820 can be expressed by a combining system.The interpolation module 1820 combines the phase-shifted carriers toproduce one or more information-modulated pulses centered at thepredetermined instants in time. The subcarrier allocation module 1814provides the carriers from which the pulses are produced. Thus, thefrequency response of the pulses may include only the sinusoidsallocated by the subcarrier allocation module 1814 to a particular user.Since each user may be assigned a unique set of carriers, the pulsewaveforms produced by the communication system can include non-zerosinusoids allocated to a particular user and zero-valued (i.e., anabsence of) sinusoids allocated to other users.

The CI transmitter components illustrated in FIG. 18B, as well as othercomponents in the transmitter, may be implemented as digital signalprocessing components. Consequently, the information-modulated pulsesgenerated by a CI transmitter may be a digital signal sample vector.

Since the CI pulses are positioned orthogonally in time if the phaseoffsets are appropriately selected, signal characteristics (e.g., phase,amplitude, frequency, etc.) of each pulse at the pulse maxima conveysthe data symbol value assigned to the corresponding phase space (i.e.,instant in time at which the pulse is centered).

FIG. 19 illustrates a CI transmitter. A set of carrier mixers 1914(which typically includes a multicarrier signal generator) is adapted toallocate a set of carriers to a particular user. Thus, the carriermixers 1914 perform the same function as a Discreet Fourier Transform(DFT) circuit combined with a zero-insertion circuit. For example,carriers corresponding to other users are removed, avoided, or otherwiseset to zero.

A phase-shift/delay system 1916 is adapted to map each of a plurality ofdata symbols from a data source 1912 to a predetermined instant in time.The data source 1912 provides data symbols to any of the transmittermodules 1914, 1916, and/or 1920. Data symbols may be modulated directlyonto individual carriers, data-bearing polyphase codes may be generated,or CI pulse waveforms may be modulated with data. The phase-shift/delaysystem 1916 applies sets of phase offsets to a plurality of carriers,which are provided by the carrier mixers 1914 and optionally modulatedwith one or more data symbols. Each set of phase offsets produces aphase alignment of the carriers (i.e., an interference pulse) at apredetermined instant in time, and thus, maps each data symbol to aninstant in time. The combination of the phase-shift/delay systems 1916and the data source 1912 produces a discrete signal of the mapped datasymbols.

A combining system 1920 combines the modulated, phase-shifted carriersto produce information-modulated pulse waveforms. These pulse waveformsare inverse Fourier transforms of the carriers represented in thefrequency domain. Thus, the combining system 1920 performs the samefunction as an Inverse-DFT circuit. Although not shown, a gainadjustment module or system (e.g., a pulse-shaping filter) mayoptionally be included in the transmitter.

CI signal generator systems may include a transmission system, such asis known in the art with respect to single carrier and multicarriercommunications. For example, a transmitter may include analog and/ordigital components typically used to process a baseband signal fortransmission into a communication channel.

FIG. 20 illustrates a specific embodiment of a CI transmitter. A carriergenerator/mixer circuit 2014 includes a pulse generator 2001 and acarrier-selection filter 2002. The pulse generator 2001 is adapted togenerate pulse having a predetermined pulse-repetition frequency toprovide a predetermined multicarrier output. Other pulse-generationparameters, such as pulse shape, may be selected and/or adapted toprovide for desirable spectral characteristics.

A subcarrier processing module 2016 may be adapted to provide phaseoffsets to the selected carriers, provide polyphase coding to thecarriers, modulate data (or coded data) symbols onto the carriers,and/or provide for carrier gain adjustments (e.g., pulse shaping,channel compensation, carrier selection, etc.). Accordingly, thesubcarrier processing module 816 may include any combination of digitalfilters, modulators, coders, phase shifters, and channel-compensationcircuits.

A combiner 2020 is optionally provided to generate a superposition ofthe carriers. A transmission module 2022 processes the basebandmulticarrier signal and couples the processed signal into acommunication channel. Although the combiner 2020 is shown coupledbetween the subcarrier processing module 816 and the transmission module2022, in-channel combining may be provided. Accordingly, transmittercomponents (not shown), such as amplifiers, frequency converters, andguard-interval modules may be provided separately to each subcarrier.

A data source 2012 is coupled to at least one of the modules 2014, 2016,and 2020. The pulse generator 2014 may be modulated with data orotherwise adapted to generate information-modulated pulses.Alternatively, the subcarrier processing module 2016 may be adapted tomodulate data onto the pulses or the selected individual carriers. Inanother embodiment of the invention, the combiner 2020 includes amodulator (not shown) adapted to modulate data symbols from data source2012 onto the superposition signal.

Some aspects may employ any of a number of techniques for providingchannel estimating. For many of these methods, a block of pilot chips,tones, or other known signals may be inserted into the transmittedwaveform. Known symbols may be mapped to CI phase spaces. Trainingsymbols may be provided to individual subcarriers. In other embodiments,various types of coded training symbols may be transmitted. Blindadaptive estimation and equalization may be employed.

FIG. 22A illustrates a plurality of CI pulse waveforms 2201 to 2209orthogonally positioned in time. A plurality N of equally spacedcarriers f₁, f₂, . . . , f_(N) are combined to generate the pulses 2201to 2209. A set of carrier phases 2211, 2212, . . . , 2219 corresponds toeach of the pulses 2201, 2202, . . . , 2209, respectively. Each set ofcarrier phases 2211, 2212, . . . , 2219 is an orthogonal polyphase CIcode (or phase space) applied to the carriers to center a given pulsewaveform at a corresponding instant in time.

A complex-valued data symbol (not shown) impressed onto a pulse (such aspulse 2201) may be characterized by an in-phase (e.g., real) partmodulated onto pulse 2201 and a quadrature-phase (e.g., imaginary) partmodulated onto a pulse waveform (not shown) centered equidistantlybetween pulses 2201 and 2202. Similarly, a first set of N real datasymbols may be impressed onto a first set of N 9 orthogonal pulses (suchas the pulses 2201 to 2209). A second set of real data symbols may beimpressed onto a quadrature-phase set of orthogonal pulses (not shown)centered equidistantly between adjacent pairs of the pulses 2201 to2209.

Complex carrier weights corresponding to each of the carriers f₁, f₂, .. . , f_(N), represent a sum of the phase spaces 2211, 2212, . . . ,2219 multiplied by their corresponding data symbols. In particular, ann^(th) (n=1, 2, . . . , N) carrier's complex weight equals the sum ofeach complex data symbol in the n^(th) row of each phase space 2211,2212, . . . , 2219 multiplied by the data symbol value (not shown)associated with that phase space 2211, 2212, . . . , 2219 (i.e., pulseposition 2201, 2202, . . . , 2209).

FIG. 22B represents a CI waveform of the present invention. A pluralityN of subcarriers 2221 to 2229 (e.g., sinusoids, or tones) arecharacterized by at least one predetermined set of complex subcarrierweights 2210. These weights 2210 align the sinusoids 2221 to 2229 toproduce a train or sequence of information-modulated pulses 2201 to 2209in the time domain. These pulses 2201 to 2209 may be generated byapplying the subcarrier weights 2210 to subcarriers (such as subcarriers2221 to 2229) allocated to at least one user in a network.

A network may be characterized by various types of communicationarchitectures having two or more users, or nodes, includingpoint-to-point, point-to-multipoint, broadcast,multipoint-to-multipoint, multipoint-to-point, hierarchical, ad-hoc,peer-to-peer, multi-hop, and cellular. The invention is independent ofthe type of network. Accordingly, other network configurations may beemployed. Similarly, the invention is independent of the propagationmedium (i.e., communication channel) connecting the nodes.

Alternatively, multiple time-offset pulses are combined wherein eachpulse 2201 to 2209 is generated from a superposition of predeterminedsubcarriers 2221 to 2229 and modulated with a corresponding data symbol.In some cases, time-domain waveforms are provided with frequency-domainprocessing (e.g., pulse-rate control, rise-time and roll-off control,pulse shaping, pulse-width control, frequency-selective filtering,windowing, and/or frequency masking) to generate pulse waveforms havingpredetermined spectral characteristics.

Variations of the disclosed pulse-generation techniques and/ormulticarrier-generation techniques, as well as other techniques, may beemployed in generating CI pulse waveforms. Pulse generators includecircuits, systems, software, etc., adapted to generate pulse waveforms.Pulse generators can also include carrier-generation circuits, systems,software, etc. having some carrier-weighting apparatus or algorithm(e.g., CI coder, phase shifter, delay device, mode-locking system, etc.)adapted to produce a plurality of carriers having complex weights thatshape a superposition of the carriers into one or more pulse waveforms.Since there are many techniques for generating CI waveforms, theinvention is not limited to any specific embodiment for generating CIwaveforms disclosed herein. Other techniques for generating CI waveformswill be evident to persons skilled in the art.

CI waveforms are typically impressed onto one or more carriers. CIsubcarriers may be impressed onto multiple transmission carrier signals,such as carriers corresponding to different frequency bands. CIwaveforms may be conveyed as analog waveforms (such as generated by aD/A converter or a bank of oscillators). CI waveforms may be digitalsignals (such as a digital output generated by an IDFT or othertransform). Digital CI waveforms may be generated from an A/D conversionof at least one analog CI waveform. Digital CI waveforms may begenerated by appropriately weighting and summing a predetermined set ofdigital sinusoids that are dynamically generated or stored in memory.Digital CI waveforms may include binary or M-ary (i.e., higher order)signals. Digital CI signals may be expressed as discreet or continuousmodulation symbols, including, but not limited to, QAM, PSK, CPM, FSK,AM, FM, PAM, and TOM. The digital signals may be transmitted in anyorder.

Various interleaving and/or channel-coding techniques may be employed inthe transmission of digital signals associated with CI waveforms. In oneaspect of the invention, coding (which is not necessarily limited tochannel coding) and/or interleaving are applied to data symbols prior togenerating the CI waveforms. In another aspect of the invention, codingand/or interleaving are applied to digitized CI signals. In yet anotherembodiment, modulation symbols may be interleaved.

The offset frequency f_(o) represents the carrier frequency. In someapplications, CI waveforms may be conveyed in their baseband form (i.e.,a carrier frequency, or offset frequency f_(o), having zero frequency).For example, baseband CI waveforms may be conveyed inside a digitalsignal processor or equivalent device, between storage devices (physicaland/or virtual memory) and signal-processing devices (e.g., DSPs,microprocessors, CPUs), inside transmitter components, inside receivercomponents, and/or between transmitter and receiver components. CIwaveforms may be conveyed in an intermediate-frequency (IF) form. Forexample, the multicarrier CI signal may be impressed on an IF carrier.Carriers having other frequencies, including optical, infra-red, andmicrowave, may be employed.

Complex subcarrier weights convey phase space (e.g., CI codes,phase-shift sets, carrier delays, pulse (time-) offset, or any otherinterpretation of carrier superposition signals resulting from carrierphase alignments at predetermined times) and information (e.g., datasymbol) values. Complex subcarrier weights may be generated from aproduct of a vector or matrix of data symbols with a vector or matrix ofphase space (i.e., CI code) values. Complex subcarrier weights may begenerated from sums of information-modulated phase spaces. Complexsubcarrier weights may be generated from a sum of products of each of aplurality of phase-shift sets corresponding to a particular phase spacewith data symbols corresponding to that particular phase space. Carrierweights may be generated by calculating or measuring subcarrieramplitudes and phases resulting from combining a plurality ofinformation-modulated, time-offset pulse waveforms.

Subcarrier weights may optionally include channel compensation weights,array-processing weights, and/or coding (e.g., channel coding,multiple-access coding, spread-spectrum coding, etc.). The subcarrierweights may optionally provide for data interleaving.

In some aspects of the invention, subcarrier weights may be providedwith at least one code (e.g., a complex-valued or real code) adapted tode-orthogonalize (e.g., provide time-domain spreading, and thus,overlapping of) the transmitted pulses. Upon reception, an appropriatederivative of the code (e.g., a complex-conjugate code) can be appliedto the appropriate frequency-domain components to re-orthogonalize thepulse waveforms.

FIG. 21 illustrates basic components of CI signal generation softwareresiding on a computer-readable medium 2199. CI signal generationsoftware is typically configured to control the function andtransmission-signal output of a single carrier or multicarriertransmitter. In some cases, a CI transmission may be characterized as asingle-carrier signal in the time domain having a plurality ofpredetermined frequency-domain (or spectral) components.

A subcarrier allocation source code segment 2191 is adapted to generatea plurality of subcarriers allocated to at least one user or allocate aplurality of input subcarriers (not shown) to a particular user. Asubcarrier weighting source code segment 2192 is adapted to providecomplex weights (e.g., CI codes) to a plurality of the allocatedsubcarriers. The weights are configured to map one or more input datasymbols into one or more phase spaces.

The computer-readable medium 2199 may include any item of manufactureadapted to store or convey software and/or firmware. The source-codesegments 2191 and 2192 may reside on a physical memory storage device,such as any magnetic, electrical, or optical device adapted to storedata and/or computer command instructions. The source-code segments 2191and 2192 may be implemented as gate configurations on a programmable orintegrated circuit. Other means for arranging physical devices and/orelectromagnetic phenomena may be employed to convey the function of thesource-code segments 2191 and 2192. Accordingly, the computer-readablemedium 2199 may include any combination of FPGAs, ASICs, transientmemory, and persistent memory.

Subcarrier allocation may include generating subcarriers, providing forreceiving input subcarriers, retrieving subcarriers or superpositionwaveforms from memory (e.g., a look-up table), or selecting non-zero (orequivalently, zero) valued input bin weights of an invertible transform,such as a DFT. In some applications, subcarrier allocation can includepulse shaping, controlling symbol durations, and/or selecting subcarrierfrequency spacing. Some frequencies may be selected or avoided relativeto channel conditions, bandwidth requirements, and/or interference.

The subcarrier allocation source code segment 2191 and subcarrierweighting source code segment 2192 may be implemented in one program.Similarly, other processing operations typically performed in acommunication system transmitter may be implemented in, or in additionto, the source-code segments 2191 and 2192. It should be appreciatedthat subcarrier allocation, selection, and assignment can includeproviding subcarriers for system control and/or monitoring. Subcarrierallocation, as described throughout the specification may includeproviding for pilot tones, training sequences, and/or other subcarriersallocated to other system-control functions. Subcarrier weighting mayinclude channel coding, source coding, spread-spectrum coding,formatting, multiple-access coding, multiplexing, encryption, arrayprocessing, and/or modulation. Systems and methods illustrated hereinand described throughout the specification may be implemented assource-code segments residing on one or more computer-readable mediums.

Network control in CI communications may be adapted to enable users toshare network resources (e.g., bandwidth). For example, channelresources in the form of phase spaces and/or subcarriers may beallocated to each user relative to their level of service. Bandwidth maybe allocated to users relative to any combination of individualthroughput requirements, purchased level of service, and availability ofbandwidth. Circuit-switched processes may be implemented with respect tosubcarrier allocations. Packet-switched processes may be implementedwith respect to phase spaces. CI communications provides for theconcurrent implementation of circuit switching and packet switching.

FIG. 23A is a functional flow chart of a CI receiver. A receiver process2301 couples at least one transmitted signal from a communicationchannel and converts it to an IF or baseband signal. Multicarrierreceivers typically include various combinations of signal-processingcomponents, such as amplifiers, filters, down converters, A/Dconverters, cyclic prefix removers, beam forming circuits, as well asother components. The receiver process 2301 may generate analog ordigital signals.

A filtering process 2302 performs a time-domain to frequency-domainconversion of the received signal to produce a plurality offrequency-domain components. Filtering may remove one or more frequencycomponents, or otherwise provide frequency-domain constraints such thatthe resulting frequency-domain components correspond to components of atleast one desired transmit signal. The frequency-domain components mayinclude subcarriers or complex weights corresponding to the magnitudeand phase of each subcarrier. Time-domain to frequency-domain processesand frequency-domain to time-domain processes are commonly performedusing Fourier transforms or cosine transforms.

An optional frequency domain equalization (FEQ) step 2303 may beprovided. The FEQ step 2303 typically involves applying complexchannel-compensation weights to the frequency-domain components. Anequalizer, as used herein, is a digital hardware/software apparatusadapted to correct for the inter-symbol interference, fading, and/orother distortions of the received digitally-encoded signals so that theinitial data can be recovered. Typically, an equalizer compensates forinter-symbol interference via several processes, such as linearequalization or decision feedback equalization. In linear equalization,the incoming signals are multiplied by the inverse of the inter-symbolinterference, generally removing inter-symbol interference from theincoming signals. A drawback of linear equalization is that noiseinherent in the data transmission is undesirably simultaneouslyamplified. Decision feedback equalization avoids the noise amplificationproblems of linear equalization, but runs the risk of error propagationsince any decision errors that are made are fed back. Other types ofequalization that may be included in the invention include maximumlikelihood sequence estimation, iterative equalization, inter-symbolinterference cancellation, and/or turbo equalization.

A combining process 2304 combines the selected frequency-domaincomponents to produce a time-domain signal (e.g., a superposition signalor a sequence of data symbols). Thus, the combining process 2304 isequivalent to other frequency-domain to time-domain conversionprocesses. Combining 2304 may be followed by an optional time-domainequalization (TEQ) step 2305 and/or an optional multi-user detection(MUD) step 2306. A decision process 2307 is adapted to estimate thereceived data in order to recover transmitted data symbols. Varioustypes of decision processing 2307 may be employed. An integration step(not shown) is typically provided with combining 2304 and/or decisionprocessing 2307 to combine samples, or otherwise process the receivedsignal, over one or more symbol durations T_(s).

A decision system, as used herein, describes any combination of devicesand/or algorithms adapted to process an input signal to provide at leastone estimate of the input signal's value. Hard and/or soft decisions maybe employed. A decision system may provide for various signal-processingtechniques (e.g., decoding, feedback, as well as various adaptiveroutines), such as are typically associated with receivers and receptiontechniques. A decision system may employ some reference, such as areference symbol constellation.

FIG. 23B illustrates a receiver method and apparatus similar to thatshown in FIG. 23A with the addition of a CI phase space decoder step2310. A plurality of CI phase spaces (i.e., time intervals) can beselected by the same transversal filter described with respect to theTEQ 2305. In this case, data symbols impressed onto different phasespaces are separated by applying the appropriate incremental delays(i.e., phase offsets) to the individual carriers prior to combining2304. If the components are complex values (e.g., output-bin values of adiscreet Fourier transform), a complex conjugate of each CI code used tomap a data symbol to a particular phase space may be employed to recoverthe corresponding mapped symbol.

FIG. 24A shows an embodiment of a CI receiver that includes a receivingmodule 2301, a filter bank 2302, a delay system (or phase-shifter bank)2310, a combiner 2304, and a decision module 2307. Received signals areprocessed by the receiving module 2301 prior to processing at the filterbank 2302. The filter bank 2302 may include a plurality of filters, suchas a plurality of analysis filters. The filter bank 2302 is typically acomplementary system with respect to a carrier synthesizer (not shown)employed on the transmit side to generate CI signals. Alternatively, thefilter bank 2302 may include a transform operation that is complementary(e.g., inverted) relative to an associated transform function in acorresponding CI transmission process. For example, the filter bank 2302may be adapted to perform a Fourier transform operation (e.g., a DFTimplemented with a fast transform algorithm, such as a fast Fouriertransform). Alternatively, the filter bank 2302 may be adapted toperform matched filtering. In any of these cases, the function of thefilter bank 2302 is to convert an input time-domain signal into aplurality of frequency-domain components.

The delay system 2310 is adapted to provide incremental delays to aplurality of subcarrier waveforms generated by the filter bank 2302.Equivalently, the delay system 2310 may provide incremental phaseoffsets to frequency-bin values or equivalent complex valuescorresponding to carrier magnitudes and phases. It is well known thatthere is a linear relationship between carrier time offsets τ andcarrier phase offsets ϕ related to a given carrier frequencyf_(n):ϕ=2πf_(n)τ. The delay system 2310 typically provides acomplementary or inverse set of delays (or equivalently, phase shifts)to the component waveforms. Accordingly, the delay system 2310 isadapted to provide complementary phase offsets (or time offsets) thatare complex conjugates of terms corresponding to each predeterminedphase space, such as the phase spaces 2211, 2212, . . . , 2219 shown inFIG. 22A.

The combiner 2304 is adapted to combine one or more sets of the delayed(or phase offset) carrier components. Combining may includeequalization, such as frequency-domain equalization. Similarly, someform of time-domain equalization and/or multi-user detection may beperformed after combining. Consequently, the combiner 2304 may includeat least one equalizer (not shown).

The combiner 2304 combines the frequency-domain components to generate atime-domain sequence, such as a reconstructed CI pulse waveform or asequence of symbol values corresponding to the transmitted data. A CIpulse waveform typically includes a plurality of orthogonally positionedCI pulses (i.e., a pulse train, such as illustrated in FIGS. 16B and17B) wherein each pulse conveys (e.g., is modulated with) a data symbol.Thus, the combiner 2304 generates signal values from data symbols thatwere mapped to predetermined instants in time (i.e., phase spaces, orpulse positions centered at equally spaced time instants) by at leastone transmitter.

The decision module 2307 processes the signal values to generateestimated data symbols. Methods of formatting information symbols, suchas mapping a constellation of data symbols to a constellation ofmodulation levels, and the reverse operation, are typically understoodto be a process within a symbol-estimation step or decision step. Suchas in which information symbols are converted to waveform symbols at atransmitter and the reverse conversion is performed at a receiver. Adecoder may perform symbol-to-bit mapping. Digital data may be mappedinto a signal point sequence with respect to a predetermined code, andan inverse mapping produces an estimated data sequence from a receivedsignal point sequence. An inverse-mapping device (not shown), which maybe part of the decision module 2307, produces an estimated data sequencefrom a received signal point sequence. Receivers may employ channelestimation. Channel estimation in multicarrier systems is typicallyregarded as part of an equalization process.

FIG. 24B illustrates a CI receiver. A DFT 2302 functions as a filterbank. A delay system 2310 is implemented as a plurality M of phase-spacemodules 2310.1 to 2310.M. Each phase-space module 2310.1 to 2310.M, suchas phase-space module 2310.1, is adapted to generate a plurality N ofphase offsets, such as 2310.11 to 2310.1N corresponding to a particularphase space. Phase-shifted values or time-offset carriers generated byeach phase-space module 2310.1 to 2310.M are coupled to a correspondingcombiner of a plurality M of combiners 2304.1 to 2304.M. A decisionmodule 2307 is adapted to process combined symbols or waveforms togenerate at least one data estimate. A decision module or a delay systemmay include at least one decoder (not shown) adapted to perform anynecessary decoding, such as channel decoding, multiple-access decoding,demultiplexing, de-spreading, decryption, etc.

FIG. 25A illustrates a CI reception method and functional components ofa CI receiver. A receiver module 2501 is adapted to processtransmissions from a communication channel to generate one or morereceived signals for baseband or IF processing. A projection module 2502is adapted to project the received signals onto at least one orthonormalbasis corresponding to at least one user's transmissions. A combiningmodule 2504 is adapted to combine the projections and optionally performequalization. Combined signals are processed in a decision module 2507adapted to generate one or more estimated data symbol values.

In particular, the steps of performing time-domain to frequency-domainconversion and filtering the frequency-domain signal may be achieved byprojecting the received signal onto the orthonormal basis of thetransmitted signals (such as indicated by the projection module 2502).Projecting a received multicarrier signal onto an orthonormal basis of aparticular user's transmitted signal produces frequency-domain signalcomponents r=(r₀, r₁, . . . , r_(N-1)) corresponding to that user'sassigned carriers. Equivalently, the projection of a received signalonto an orthonormal basis excludes signals (e.g., carriers and/or phasespaces) that do not correspond to that orthonormal basis.

FIG. 25B illustrates a CI receiver method and system. A receiver module2501 is adapted to process and couple one or more transmitted signalsfrom a communication channel to a matched filter 2502. The receivermodule 2501 is adapted to perform various types of signal processing(e.g., amplification, filtering, down conversion, A/D conversion,guard-interval removal, beam forming, and/or other types of signalprocessing) to modify a received signal into an appropriate format forbaseband or IF signal processing. The modified signal may include ananalog or digital signal.

The matched filter 2502 is typically matched to one or more signalcharacteristics (e.g., subcarriers, phase spaces, time intervals, codes,etc.) of at least one user or data stream. Different users and/ortransmitted data symbols are typically characterized by at least one setof unique diversity parameter values, such as carrier frequencies, phasespaces, time intervals, codes, subspaces, polarizations, or combinationsthereof. Other diversity parameters may be used to characterizedifferent users and/or data streams. The matched filter 2502 may includeone or more matched-filter elements.

The output(s) of the matched filter 2502 typically characterizes thedegree of matching (e.g., correlation) of the filter 2502 with thereceived signal(s). Measured variations in the degree of matching canindicate the transmitted symbol values. Thus, these measurements may bemapped to a predetermined symbol constellation. The temporalcharacteristics (e.g., synchronization and duration) of thesemeasurements are typically selected in an integrator 2504. Theintegrator's 2504 function is typically optimized relative to theprobability of error (or BER) of the symbol estimates generated by adecision module 2507.

Integration represents combining in the time domain. Consequently,integration may be part of a combining process (not shown).Frequency-domain combining is typically performed in the matched filter2502. For example, matching of a particular phase space includes carrierselection, and accordingly, a combining of the appropriatelyphase-shifted carriers. Alternatively, the matched filter 2502 simplymatches components of a signal space corresponding to a particular useror data channel. In this case, the integrator 2504 produces valuescorresponding to the components over a predetermined time interval, andthe decision module 2507 combines the component values to generatesymbol estimates. Thus, the matched filter 2502 may employ polyphasecodes corresponding to CI phase spaces as part of its matching function.Similarly, the decision module 2507 may employ polyphase CI codes aspart of a combining process.

The decision module 2507 may be adapted to perform any of variousfunctions related to data-symbol processing. For example, the decisionmodule 2507 may perform any combination of channel decoding,demodulation, spread-spectrum decoding, de-interleaving, demultiplexing,multiple-access decoding, and formatting. Equalization may be performedby one or more receiver modules 2502, 2504, and/or 2507.

FIG. 26A illustrates a CI receiver apparatus and method of theinvention. A receiver module or system 2501 is adapted to receive andprocess at least one transmitted signal to provide a digital or analogtime-domain signal to a first software module 2502. The first softwaremodule 2502 is adapted to project the received signal onto theorthonormal basis of the transmitted signals. This achieves a combinedtime-domain to frequency-domain transform and tone filtering.

The first software module 2502 includes a plurality N of multipliers2511.1 to 2511.N adapted to multiply the received signal by referencesignals having orthogonal carrier frequencies f_(n)=f_(o)+nf_(s) (n=0, .. . , N−1) and at least one predetermined phase relationship nΔΦ_(k).Software module 2502 also includes a plurality N of integrators 2504.1to 2501.N adapted to integrate the products over each symbol intervalT_(s). The outputs of the first module 2502 are frequency-domain signalcomponents r=(r₀, r₁, . . . , r_(N-1)) corresponding to a particularuser's assigned carriers. The first module 2502 is typically adapted togenerate phase offsets ΔΦ corresponding to a plurality of phase spaces(i.e., time offsets).

A second software module 2514 takes the form of a combiner, whichperforms a frequency-domain to time-domain transform. Equalization (notshown) may be performed by either or both first and second modules 2502and 2514, respectively. Time-domain equalization and/or frequency-domainequalization may be employed. Various combining techniques, such as anyappropriate optimal-combining technique may be employed. The combinedfrequency-domain components produce a time-domain signal, such as shownin FIGS. 1, 2B, and 3B. The time-domain signal may include an analog ordigital waveform. Alternatively, a time-domain signal may include asequence of digital symbol values.

Each set of phase offsets ΔΦ corresponds to a particular phase space ortime offset. Each received data symbol is characterized by adata-modulated pulse centered at a particular time instant. Theinclusion of phase selection in the reference signals used in themultipliers 2511.1 to 2511.N of the first software module 2502 providesfor selection of signal values at predetermined instants in time. Thus,the process of combining 2514 the phase-offset signals generated in thefirst module 2502 is part of a time-instant to symbol-mapping process.Decision processing 2507 provides for estimation of the received data.Decision processing 2507 is a mapping process that maps received signalvalues corresponding to each pulse (i.e., equally spaced instants intime used to transmit symbol values) into decision variables (i.e.,estimated signal values).

FIG. 26B illustrates a CI receiver, including a receiver module 2501, amatched filter or projection module 2502, a plurality M of integrators2504.1 to 2504.M, and a decision device 2507. The projection module 2502includes a discreet Fourier transform (e.g., FFT 2512). Equivalently,other types of filters may be included, such as to select one or moresubcarrier components allocated to a particular user. N frequency-domaincomponents generated by the FFT 2512 are phase shifted by a plurality Mof phase-shift systems (e.g., interval delay systems) 2510.1-2510.M. TheN signal components corresponding to each phase-shift system2510.1-2510.M are combined in an associated combiner 2514.1 to 2514.M togenerate a time-domain signal.

A plurality M of time-domain signals is output from the projectionmodule 2502. Each of the M time-domain signals is integrated over eachsymbol interval T_(s) by the integrators 2504.1 to 2504.M. Signal valuesgenerated by the integrators 2504.1 to 2504.M are processed by thedecision module 2507 to generate a sequence of estimated data symbols.

Various embodiments may include variations in system configurations andthe order of steps in which methods are provided. For example, the orderof frequency-domain combining (illustrated by the combiners 2514.1 to2514.M) and time-domain combining (illustrated by the integrators 2504.1to 2504.M) may be switched. Multiple steps and/or multiple componentsmay be consolidated.

FIG. 26C illustrates a subcarrier weighting source code segment 2591 anda CI combining source code segment 2592 residing on a computer-readablemedium 2599. Source code segment 2591 is adapted to process one or morereceived channel measurements (such as frequency-domain or time-domainmeasurements) for generating a plurality of subcarrier weights. Theseweights are adapted to compensate for one or more channel effects,including, but not limited to, multipath, dispersion, and co-channelinterference. The weights may be adapted to provide CI decoding. Theweights may be adapted relative to one or more channel and/ordata-quality measurements. The weights may be configured relative todata-processing measurements, such as hard-decision, soft-decision,and/or iterative feedback decision processing. The weights are typicallyapplied to a plurality of subcarriers, such as frequency componentsproduced by a filter bank or an FFT. Subcarrier weighting may includefiltering, such as providing for acquiring subcarrier frequenciesallocated to at least one predetermined user. Consequently, subcarrierweights may include both zero and non-zero values. Subcarrier weightingmay include channel decoding, source decoding, spread-spectrum decoding,formatting, multiple-access decoding, demultiplexing, decryption, arrayprocessing, and/or modulation.

Source-code segment 2592 is adapted to combine the received and weightedcarriers to generate a processed signal output, which is typically asequence of symbols. At least one type of optimal combining may beprovided. Code segment 2592 is adapted to receive as input at least onereceived signal, such as a sequence of data symbols. The received signalmay be impressed onto the weights, weighted subcarriers, or waveformsgenerated from one or more superpositions of the weighted subcarriers.The weights are configured to map one or more input data symbols intoone or more phase spaces. In some applications, data-modulated weightsmay be generated in source-code segment 2591. In this case, source-codesegment 2591 is adapted to process the received signal to generate atleast one set of information-bearing weights.

FIG. 27A illustrates a number M of CI receiver branches. A plurality ofinput couplers (e.g., antenna elements) 2701.1 to 2701.M couple signalsfrom a communications medium (e.g., a free-space channel, a waveguide,etc.) and process the signals. The input couplers 2701.1 to 2701.M aretypically adapted to perform any combination of front-end receiver-sideprocessing, including amplification, filtering, frequency conversion,and/or A/D conversion. Other types of processing may be performed. Forexample, a plurality of optional guard interval (e.g., cyclic prefix)removal circuits 2702.1 to 2702.M may be incorporated in the inputcouplers 2701.1 to 2701.M. Similarly, each of a plurality M ofserial-to-parallel converters 2703.1 to 2703.M may be included in theinput couplers 2701.1 to 2701.M or in each of a plurality M ofinvertible-transform (e.g., FFT) circuits 2704.1 to 2704.M.

Each of the invertible-transform circuits 2704.1 to 2704.M transforms aninput time-domain signal into a plurality N of frequency-domaincomponents. The components are weighted with at least one set of CIcombining weights α_(m)(n), where m=1, . . . ,M and n=1, . . . , N, by aplurality M of component-weighting modules 2705.1 to 2705.M. In the casewhere MMSE combining is employed, the weights am(n) are expressed by:α_(m)(n)=h _(m)*(n)/(N|h _(m)(n)|²+σ²)where h_(m)(n) is the channel response for the n^(th) frequency channelof the m^(th) spatial subchannel, and σ² is the noise power. Other typesand combinations of combining may be employed.

A plurality M of combiners, such as IFFTs 2706.1 to 2706.M, combine theweighted frequency-domain components to generate a plurality oftime-domain signals. Time-domain outputs of the IFFTs 2706.1 to 2706.Mare coupled to beam-forming modules 2707.1 to 2707.M, which are adaptedto provide beam-forming weights that cancel co-channel interference in aplurality of combiners 2708.1 to 2708.M. Each combiner 2708.1 to 2708.Mmay include a summing circuit, an adder, an accumulator, an integrator,or any appropriate invertible transform.

The beam-forming modules 2707.1 to 2707.M and the combiners 2708.1 to2708.M may be adapted to perform any of various types and combinationsof adaptive combining. In some applications, maximal ratio combining maybe employed. Other combining schemes may be employed. Combining mayinclude interference cancellation, multi-user detection, null steering,spatial interferometry multiplexing, etc. In some cases, space-timeprocessing may be employed. Successive interference cancellation, aswell as other multi-level cancellation techniques, can be used. In othercases, space-frequency processing may be provided. Channel decodingweights may be provided by either or both the component-weightingmodules 2705.1 to 2705.M and the beam-forming modules 2707.1 to 2707.M.Symbols output by the combiners 2708.1 to 2708.M are converted to a datastream by a parallel-to-serial converter 2709 prior to being demodulatedand decoded 2710.

In some disclosed aspects, the subcarriers may be selected for aparticular user, such as in an orthogonal frequency division multipleaccess system. Subcarriers allocated to a particular user may beinterleaved in frequency with subcarriers allocated to one or more otherusers. In another aspect of the invention, a different set ofsubcarriers is selected for each of a plurality of data symbols or datasymbol groups transmitted by and/or to a particular user. A plurality ofusers may share a common set of subcarriers, yet share the channel viatime division multiple access (TDMA), code division multiple access(CDMA), and/or space division multiple access (SDMA). Othermultiple-access schemes may be employed. Similarly, different datasymbols corresponding to a particular user may share the channelrelative to the previously mentioned multiple-access schemes.

In one aspect, a signal generator or transmitter includes a subcarrierallocator, a pulse generator, a modulator, and a sequential pulsepositioner. The subcarrier allocator assigns a predetermined set ofsubcarriers to a particular data symbol, user, or group of users. Thepulse generator produces a plurality of pulses wherein the spectrum ofeach pulse or group of pulses is characterized by the set ofsubcarriers. The modulator modulates the pulses or subcarriers with atleast one data symbol. The pulse positioner sequentially positions themodulated pulses.

A transmitter may include a polyphase, poly-amplitude code generator, asubcarrier allocator, a subcarrier weighting module, and a subcarriercombiner. The code generator produces at least one of a set ofpolyphase, poly-amplitude codes configured to produce a predeterminedtime-domain signal, such as a direct sequence coded signal. Thetransmitter may include a modulator adapted to modulate data onto thecodes, the subcarriers, or the time-domain signal. The subcarrierweighting module impresses the polyphase, poly-amplitude codes onto apredetermined set of orthogonal subcarriers selected by the subcarrierallocator. The combiner combines the subcarriers to produce thetime-domain signal.

A CI decoder may include receiver components illustrated in the figuresand described throughout the specification and incorporated references.For example, a CI decoder may include an equalizer (such as atime-domain equalizer and/or a frequency-domain equalizer), a de-mapper,a de-interleaver, a decoder, a de-scrambler, a filter (such as a matchedfilter), an integrator, and/or a decision module.

CI receivers may be adapted to process either or both single-carrier andmulticarrier signals. Frequency-domain analysis and processing ofsingle-carrier signals may be performed relative to pulsecharacteristics. For example, number of subcarriers, subcarrier spacing,and window durations in receiver processing may be selected relative tophysical signal parameters, such as pulse width, pulse shape, and pulsespacing.

In one aspect, a received signal is separated into a plurality oforthogonal subcarrier components by a time-domain to frequency-domainconverter. The output of the converter is characterized by orthogonalpoly-amplitude (and polyphase) coded data. The converter may be adaptedto perform a Fourier transform, such as an FFT or a DFT. A combinerperforms frequency-domain equalization and provides CI decoding of thecoded data.

Functional aspects are described with respect to signal-waveformillustrations and corresponding descriptions. For example, FIG. 27Billustrates a block transmission characterized by symbol duration T_(s),and includes four orthogonal sinc-like pulse waveforms 341, 342, 343,and 344. Each pulse waveform (such as pulses 341, 342, 343, and 344) maybe impressed with a unique data symbol.

A preceding block transmission includes orthogonal pulse waveforms 331,332, 333, and 334 and a following block transmission includes orthogonalpulse waveforms 351, 352, 353, and 354. Block transmissions arecharacteristic of multicarrier operation. For example, OFDM employssubcarrier blocks defined by uniform start and end times for eachsubcarrier, the difference in times typically being equal to the symbolduration T_(s), or the symbol duration T_(s) plus a cyclic prefix.Cyclic prefixes, cyclic “post-fixes”, or some other guard interval maybe included in the signal plots, such as between the blocks shown inFIG. 27B.

Since the pulse waveforms 341, 342, 343, and 344 have the same startingand ending times, the waveform shapes 341, 342, 343, and 344 aredifferent from each other. For example, waveform 341 has all of itssidelobes to the right of its main lobe, whereas all of the sidelobes ofwaveform 344 occur to the left of the main lobe. This tends to increasethe interference in systems that perform time-domain equalization andRake reception. In particular, inter-pulse interference is not limitedto nearby pulses because the side-lobe structure is periodic, or cyclic,over the symbol duration Ts. For example, the side-lobe amplitude (andthus, interference) of waveform 341 diminishes across pulse 342 andincreases across pulse 344. In this particular example, the pulsewaveforms may be generated from four orthogonal subcarrier frequencies,which are not shown.

FIG. 28A illustrates a CI transmitter that includes a CI coder 2802, anIDFT (such as IFFT 2804), a polyphase filter 2809, and a transmissionsystem 2807. The CI coder 2802 is adapted to map multiple input datasymbols onto a plurality of subcarriers. This is achieved via CI coding.The IFFT 2804 is adapted to receive the plural sub-channel signals andtransform them into plural time-domain signals. The polyphase filter2809 receives the time-domain signals and outputs a plurality offiltered signals. The polyphase filter 2809 may be adapted to providethe filtered signals with a predetermined spectral profile of selectedsubcarriers. Polyphase filters operate by multiplying selected phases,or samples, of a filter impulse response with samples of one or moreinput signals.

FIG. 28B illustrates a CI reception method that implies an apparatus forcarrying out the method. A receiver step 2851 processes transmissionsfrom a communication channel to generate received signals. Time-domainto frequency-domain conversion and filtering the resultingfrequency-domain signal is achieved by projecting the received signalonto an orthonormal basis of the transmitted signals (such as indicatedby a projection step 2852). Projecting a received multicarrier signalonto an orthonormal basis of a particular user's transmitted signalproduces frequency-domain signal components r=(r₀, r₁, . . . , r_(N-1))corresponding to that user's assigned subcarriers. Equivalently, theprojection of a received signal onto an orthonormal basis excludessignals (e.g., carriers and/or phase spaces) that do not correspond tothat orthonormal basis.

Frequency-domain to time-domain conversion is achieved by combining 2854the received frequency-domain components produced by either band-passfiltering or projection onto a predetermined orthonormal basis. Thecombined frequency-domain components produce a time-domain signal. Thestep of recovering symbols is provided in the decision process 2857.

FIG. 28C illustrates a CI receiver including a receiver module 2861, amatched filter or projection module 2862, a plurality M of integrators2864.1 to 2864.M, and a decision device or module 2867. The projectionmodule 2862 includes a DFT, such as an FFT 2872. Equivalently, othertypes of filters may be included, such as to select one or moresubcarrier components allocated to a particular user. N frequency-domaincomponents generated by the FFT 2872 are phase shifted by a plurality Mof phase-shift systems (e.g., interval-delay systems) 2870.1 to 2870.M.The N signal components corresponding to each phase-shift system 2870.1to 2870.M are combined in an associated combiner 2874.1 to 2874.M togenerate a time-domain signal.

A plurality M of time-domain signals is output from the projectionmodule 2862. Each of the M time-domain signals is integrated over eachsymbol interval T_(s), by the integrators 2864.1 to 2864.M. Signalvalues generated by the integrators 2864.1 to 2864.M are processed bythe decision module 2867 to generate a sequence of estimated datasymbols.

Various embodiments of the invention may include variations in systemconfigurations and the order of steps in which methods are provided.Multiple steps and/or multiple components may be consolidated.

FIG. 29A illustrates a block waveform including a set of N orthogonal CIpulse waveforms 2941 to 2949 having a duration of T_(s). CI pulsewaveforms (such as pulse 2941 to 2949) may be generated from asuperposition of orthogonal subcarriers. Each of the pulse waveforms2941 to 2949, which represents a CI phase space, is modulated with oneof a plurality of data symbols d₁ to d_(N), respectively. In one aspectof the invention, each data symbol d₁ to d_(N) includes a code chip ofan orthogonal code, such as Hadamard-Walsh (Walsh) code or a Walsh codemultiplied by a long code. Pseudo-orthogonal coding may be employed.Other codes, including Gold codes, Barker codes, Kasami codes, CI codes,and/or DeBot codes, may be modulated onto the pulses 2941 to 2949. Thesubcarrier weights resulting from the application of these time-domaincodes provide orthogonal or pseudo-orthogonal CI codes expressed asfrequency-domain codes, which are characterized by low PAPR inmulticarrier synthesis.

FIG. 29B illustrates a plurality of CI subcarrier weights w₁ to w_(N)generated from a set of data symbols d₁ to d_(N) mapped to a number N oforthogonal CI phase spaces. A CI code matrix of dimension N×N containingpolyphase code chips is multiplied by a set of data vectors or a datamatrix. In particular, each column of the CI code matrix (such as column2951) is multiplied by a corresponding data symbol (such as symbol d₂).In some cases, the CI code matrix and an N×N data matrix (not shown) maybe provided with an element-by-element multiplication. Each row of aproduct matrix resulting from the product of the data symbols d₁ tod_(N) with the CI code matrix are summed to produce the subcarrierweights w₁ to w_(N). For example, elements in row 2953, aftermultiplication by the data symbols d₁ to d_(N), are summed to generateweight w₂. Since rows and columns of the basic CI code matrix resemblethe vectors of complex values used in DFTs, the subcarrier weights w₁ tow_(N) can be calculated using a fast transform algorithm.

FIG. 30A illustrates transmitter apparatus and method embodiments of thepresent invention. An input data stream is serial-to-parallel convertedand processed in a subcarrier-weighting module 3002. The weightingmodule 3002 provides one or more orthogonal poly-amplitude codes to thesubcarriers. The codes may also be characterized by polyphase values.The codes are typically indicative of the data and are used assubcarrier weights. In this case, block codes are provided. The weightsmay be used to synthesize at least one predetermined direct-sequence(e.g., DSSS or DS-CDMA) waveform. The weights are converted to at leastone time-domain waveform in a frequency-domain to time-domain converter3004, such as an inverse Fourier transform.

The time-domain output of the converter 3004 is processed in atransmission system 3006, which may optionally provide a guard intervalor cyclic prefix (and/or postfix), perform digital-to-analog conversion,up convert the signal, provide amplification, optionally filter thesignal, and provide for coupling the signal into a communicationchannel. Other transmitter-side signal-processing operations may beprovided, including MIMO (e.g., array) processing. This transmitterembodiment may be adapted to generate multicarrier signals configured toappear as a single-carrier signal in the time domain.

FIG. 30B shows a receiver apparatus and method of the invention. Areceiver system 3001 couples single-carrier and/or multicarriertransmissions from a communication channel, and adapts the receivedsignals for baseband or IF processing. In particular, the receiversystem 3001 may perform filtering, amplification, down conversion,analog-to-digital conversion, cyclic-prefix removal, and/or otherreceiver processing operations that are well known in the art. Thereceiver system 3001 may be adapted to perform MIMO (e.g., array)processing. A received signal is separated into a plurality oforthogonal subcarrier components by a time-domain to frequency-domainconverter 3003, such as a Fourier transform. Frequency-domainequalization and decoding of the orthogonal poly-amplitude codes isperformed in a combiner 3005. The combiner 3005 multiplies the frequencybin values output by the converter 3003 with a complex conjugate of atleast one of poly-amplitude code. A decision module 3007 is adapted toprocess the combined signal values using any combination ofhard-decision and soft-decision processing.

In one aspect, a received signal for at least one user is separated intoorthogonal frequency components. Channel compensation (e.g.,equalization) and combining are performed to provide estimates of thetransmitted symbols. ISI may be compensated via any combination ofequalization and multi-user detection.

Embodiments may employ any of a number of techniques for providingchannel estimating. For many of these methods, a block of pilot chips,tones, or other known signals may be inserted into the transmittedwaveform. Known symbols may be mapped to CI phase spaces. Trainingsymbols may be provided to individual subcarriers. In other embodiments,various types of coded training symbols may be transmitted. Blindadaptive estimation and equalization may be employed.

FIG. 31A illustrates a communication method of the invention. Aplurality of orthogonal polyphase/poly-amplitude codes are generated3061 in a transmitter. The codes are modulated 3062 with different datasymbols. A-frequency-domain to time-domain conversion 3063 of themodulated codes is provided to generate a time-domain output. A cyclicprefix or guard interval is optionally prepended 3064 to the time-domainoutput, followed by transmission processing 3065 adapted to process thesignal for transmission into a communication channel 99.

A receiver process 3071 couples the transmission from the channel 99 andperforms receiver system processes typically performed to convert areceived signal to a digital or analog baseband or IF signal. Anoptional cyclic-prefix removal 3072 may be performed as necessary priorto time-domain to frequency-domain conversion 3073. Interferingfrequency-domain signals are separated in an interference-cancellationprocess 3074, which may optionally employ frequency-domain and/ortime-domain equalization. Separated signal values are then postprocessed, which may include decision processing 3075.

FIG. 31B illustrates a method of receiving single-carrier ormulticarrier signals, including providing for receiver-system processing3151 of received signals, performing a time-domain to frequency-domainconversion 3153 of the received signals to produce a plurality oforthogonal subcarrier values, providing forfrequency-domain-equalization of the subcarrier values, providing for CIdecoding 3157 (which includes combining), and providing for decisionprocessing 3159.

FIG. 32 illustrates a sub-space/subcarrier processor receiver of theinvention. A plurality M of receiver systems 3251 to 3259 is adapted tocouple a plurality of interfering single-carrier or multicarrier signalsfrom a communication channel. M receiver branches are provided forfrequency-domain analysis of received signals. Optional cyclic prefixremoval modules 3261 may be provided. A set of M time-domain tofrequency-domain converters, such as DFTs 3271 to 3279, separatereceived signals in each branch into a plurality N of subcarrier values.Each of a plurality of sub-space processors 3281 to 3289 processes thesubcarrier values. For example, N sub-space processors 3281 to 3289 canprocess M signals at a time that were mapped into each of the Nsubcarrier frequencies.

The output of each sub-space processor 3281 to 3289 is characterized byup to M sub-space values. Each of a plurality of CI decoders 3291 to3299, such as CI block decoders or CI sliding window decoders, combinesubcarrier values corresponding to a particular subspace.

FIG. 33A illustrates basic components of CI signal generation softwareresiding on a computer-readable medium 3399. CI signal generationsoftware is typically configured to control the function andtransmission-signal output of a single carrier or multicarriertransmitter. In some cases, a CI transmission may be characterized as asingle-carrier signal in the time domain having a plurality ofpredetermined frequency-domain (or spectral) components.

A subcarrier allocation source code segment 3301 is adapted to generatea plurality of subcarriers allocated to at least one user or allocate aplurality of input subcarriers (not shown) to a particular user. Asubcarrier weighting source code segment 3302 is adapted to providecomplex weights (e.g., CI codes) to a plurality of the allocatedsubcarriers. The weights are configured to map one or more input datasymbols into one or more phase spaces.

The computer-readable medium 3399 may include any item of manufactureadapted to store or convey software and/or firmware. The source-codesegments 3301 and 3302 may reside on a physical memory storage device,such as any magnetic, electrical, or optical device adapted to storedata and/or computer command instructions. The source-code segments 3301and 3302 may be implemented as gate configurations on a programmable orintegrated circuit. Other means for arranging physical devices and/orelectromagnetic phenomena may be employed to convey the function of thesource-code segments 3301 and 3302. Accordingly, the computer-readablemedium 3399 may include any combination of FPGAs, ASICs, transientmemory, and persistent memory.

Subcarrier allocation may include generating subcarriers, providing forreceiving input subcarriers, retrieving subcarriers or superpositionwaveforms from memory (e.g., a look-up table), or selecting non-zero (orequivalently, zero) valued input bin weights of an invertible transform,such as a DFT. In some applications, subcarrier allocation can includepulse shaping, controlling symbol durations, and/or selecting subcarrierfrequency spacing. Some frequencies may be selected or avoided relativeto channel conditions, bandwidth requirements, and/or interference.

The subcarrier allocation source code segment 3301 and subcarrierweighting source code segment 3302 may be implemented in one program.Similarly, other processing operations typically performed in acommunication system transmitter may be implemented in, or in additionto, the source-code segments 3301 and 3302. It should be appreciatedthat subcarrier allocation, selection, and assignment can includeproviding subcarriers for system control and/or monitoring. Subcarrierallocation, as described throughout the specification may includeproviding for pilot tones, training sequences, and/or other subcarriersallocated to other system-control functions. Subcarrier weighting mayinclude channel coding, source coding, spread-spectrum coding,formatting, multiple-access coding, multiplexing, encryption,modulation, and/or array processing. Systems and methods illustratedherein and described throughout the specification may be implemented assource-code segments residing on one or more computer-readable mediums.

Network control in CI communications may be adapted to enable users toshare network resources (e.g., bandwidth). For example, channelresources in the form of phase spaces and/or subcarriers may beallocated to each user relative to their level of service. Bandwidth maybe allocated to users relative-to any combination of individualthroughput requirements, purchased level of service, and availability ofbandwidth.

FIG. 33B illustrates a subcarrier weighting source code segment 3391 anda CI combining source code segment 3392 residing on a computer-readablemedium 3399. Source code segment 3391 is adapted to process one or morereceived channel measurements (such as frequency-domain or time-domainmeasurements) for generating a plurality of subcarrier weights. Theseweights are adapted to compensate for one or more channel effects,including, but not limited to, multipath, dispersion, and co-channelinterference. The weights may be adapted to provide CI decoding. Theweights may be adapted relative to one or more channel and/ordata-quality measurements. The weights may be configured relative todata-processing measurements, such as hard-decision, soft-decision,and/or iterative feedback decision processing. The weights are typicallyapplied to a plurality of subcarriers, such as frequency componentsproduced by a filter bank or an FFT. Subcarrier weighting may includefiltering, such as providing for acquiring subcarrier frequenciesallocated to at least one predetermined user. Consequently, subcarrierweights may include both zero and non-zero values. Subcarrier weightingmay include channel decoding, source decoding, spread-spectrum decoding,formatting, multiple-access decoding, demultiplexing, decryption, arrayprocessing, and/or modulation.

Source-code segment 3392 is adapted to combine the received and weightedcarriers to generate a processed signal output, which is typically asequence of symbols. At least one type of optimal combining may beprovided. Code segment 3392 is adapted to receive as input at least onereceived signal, such as a sequence of data symbols. The received signalmay be impressed onto the weights, weighted subcarriers, or waveformsgenerated from one or more superpositions of the weighted subcarriers.The weights are configured to map one or more input data symbols intoone or more phase spaces. In some applications, data-modulated weightsmay be generated in source-code segment 3391. In this case, source-codesegment 3391 is adapted to process the received signal to generate atleast one set of information-bearing weights.

All publications and patent applications mentioned in this specificationare herein incorporated by reference to the same extent as if eachindividual publication or patent application was specifically andindividually incorporated by reference.

Various embodiments of the invention may include variations in systemconfigurations and the order of steps in which methods are provided. Inmany cases, multiple steps and/or multiple components may beconsolidated.

The method and system embodiments described herein merely illustrate theprinciples of the invention. It should be appreciated that those skilledin the art will be able to devise various arrangements, which, althoughnot explicitly described or shown herein, embody the principles of theinvention and are included within its spirit and scope. Furthermore, allexamples and conditional language recited herein are intended to be onlyfor pedagogical purposes to aid the reader in understanding theprinciples of the invention. This disclosure and its associatedreferences are to be construed as being without limitation to suchspecifically recited examples and conditions. Moreover, all statementsherein reciting principles, aspects, and embodiments of the invention,as well as specific examples thereof, are intended to encompass bothstructural and functional equivalents thereof. Additionally, it isintended that such equivalents include both currently known equivalentsas well as equivalents developed in the future, i.e., any elementsdeveloped that perform the same function, regardless of structure.

It should be appreciated by those skilled in the art that the blockdiagrams herein represent conceptual views of illustrative circuitry,algorithms, and functional steps embodying the principles of theinvention. Similarly, it should be appreciated that any flow charts,flow diagrams, signal diagrams, system diagrams, codes, and the likerepresent various processes which may be substantially represented incomputer-readable medium and so executed by a computer or processor,whether or not such computer or processor is explicitly shown.

The functions of the various elements shown in the drawings, includingfunctional blocks labeled as “processors” or “systems,” may be providedthrough the use of dedicated hardware as well as hardware capable ofexecuting software in association with appropriate software. Whenprovided by a processor, the functions may be provided by a singlededicated processor, by a shared processor, or by a plurality ofindividual processors, some of which may be shared. Moreover, explicituse of the term “processor” or “controller” should not be construed torefer exclusively to hardware capable of executing software, and mayimplicitly include, without limitation, digital signal processor (DSP)hardware, read-only memory (ROM) for storing software, random accessmemory (RAM), and non-volatile storage. Other hardware, conventionaland/or custom, may also be included. Similarly, the function of anycomponent or device described herein may be carried out through theoperation of program logic, through dedicated logic, through theinteraction of program control and dedicated logic, or even manually,the particular technique being selectable by the implementer as morespecifically understood from the context.

Any element expressed herein as a means for performing a specifiedfunction is intended to encompass any way of performing that functionincluding, for example, a combination of circuit elements which performsthat function or software in any form, including, therefore, firmware,micro-code or the like, combined with appropriate circuitry forexecuting that software to perform the function. The invention asdefined herein resides in the fact that the functionalities provided bythe various recited means are combined and brought together in themanner which the operational descriptions call for. Applicant regardsany means which can provide those functionalities as equivalent as thoseshown herein.

The invention claimed is:
 1. A method for receiving an OrthogonalFrequency Division Multiplexing (OFDM) signal transmitted by a userdevice in a wireless network, the method comprising: determining aplurality of subcarrier frequencies allocated to the user device;converting the OFDM signal to a plurality of frequency-domain valuescorresponding to the plurality of subcarrier frequencies; and decodingthe plurality of frequency-domain values to recover a plurality of datasymbols encoded by the user device on the plurality of subcarrierfrequencies; wherein decoding employs a plurality of codes that areinverse to, complex-conjugate of, or complementary to a set ofcomplex-valued codes that the user device employs to shape the OFDMsignal into a superposition of cyclic-shifted pulse waveforms that eachhas one of the plurality of data symbols modulated thereon.
 2. Themethod of claim 1, wherein each of the plurality of codes employed fordecoding comprises a different vector of linear phase offsets.
 3. Themethod of claim 1, wherein the cyclic-shifted waveforms have cyclicshifts that cause the cyclic-shifted waveforms to be orthogonal, andeach of the plurality of codes employed for decoding comprises a set oflinear phase offsets that corresponds to one of the cyclic shifts. 4.The method of claim 1, wherein the complex-valued codes cause thecyclic-shifted waveforms to be Sinc waveforms, and the plurality ofcodes is configured to decode the Sinc waveforms.
 5. The method of claim1, wherein the plurality of subcarrier frequencies has a frequencyspacing f_(s), and the plurality of cyclic-shifted waveforms areperiodic over a symbol interval T_(s)=1/f_(s).
 6. The method of claim 1,wherein converting the OFDM signal to a plurality of frequency-domainvalues uses a discrete Fourier transform.
 7. The method of claim 1,further comprising removing at least one of a guard interval, a cyclicprefix, and a cyclic postfix from the OFDM signal before converting theOFDM signal to the plurality of frequency-domain values.
 8. The methodof claim 1, wherein converting the OFDM signal to the plurality offrequency-domain values provides for orthogonal frequency divisionmultiple access for the user device and at least one other user device.9. The method of claim 1, wherein an m^(th) one of the plurality ofcodes is expressed as a set of N code chips for a set of integers n={0,. . . , N−1}, wherein each code chip is expressed by e^(i2πnm/N),wherein i is the square root of −1, and π is Pi.
 10. An apparatus forreceiving an Orthogonal Frequency Division Multiplexing (OFDM) signaltransmitted by a user device in a wireless network, the apparatuscomprising: at least one processor; and a non-transitorycomputer-readable memory communicatively coupled to the at least oneprocessor, the non-transitory computer-readable memory including a setof instructions stored thereon and executable by the at least oneprocessor for: determining a plurality of subcarrier frequenciesallocated to the user device; converting the OFDM signal to a pluralityof frequency-domain values corresponding to the plurality of subcarrierfrequencies; and decoding the plurality of frequency-domain values torecover a plurality of data symbols encoded by the user device on theplurality of subcarrier frequencies; wherein decoding employs aplurality of codes that are inverse to, complex-conjugate of, orcomplementary to a set of complex-valued codes that the user deviceemploys to shape the OFDM signal into a superposition of cyclic-shiftedpulse waveforms that each has one of the plurality of data symbolsmodulated thereon.
 11. The apparatus of claim 10, wherein each of theplurality of codes employed for decoding comprises a different vector oflinear phase offsets.
 12. The apparatus of claim 10, wherein thecyclic-shifted waveforms have cyclic shifts that cause thecyclic-shifted waveforms to be orthogonal, and each of the plurality ofcodes employed for decoding comprises a set of linear phase offsets thatcorresponds to one of the cyclic shifts.
 13. The apparatus of claim 10,wherein the complex-valued codes cause the cyclic-shifted waveforms tobe Sinc waveforms, and the plurality of codes is configured to decodethe Sinc waveforms.
 14. The apparatus of claim 10, wherein the pluralityof subcarrier frequencies has a frequency spacing f_(s), and theplurality of cyclic-shifted waveforms are periodic over a symbolinterval T_(s)=1/f_(s).
 15. The apparatus of claim 10, whereinconverting the OFDM signal to a plurality of frequency-domain valuesuses a discrete Fourier transform.
 16. The apparatus of claim 10,wherein the non-transitory computer-readable memory further includesinstructions stored thereon and executable by the at least one processorfor removing at least one of a guard interval, a cyclic prefix, and acyclic postfix from the OFDM signal before converting the OFDM signal tothe plurality of frequency-domain values.
 17. The apparatus of claim 10,wherein converting the OFDM signal to the plurality of frequency-domainvalues provides for orthogonal frequency division multiple access forthe user device and at least one other user device.
 18. The apparatus ofclaim 10, wherein an m^(th) one of the plurality of codes is expressedas a set of N code chips for a set of integers n=, {0, . . . , N−1},wherein each code chip is expressed by e^(i2πnm/N), wherein i is thesquare root of −1, and π is Pi.
 19. A computer program product forreceiving an Orthogonal Frequency Division Multiplexing (OFDM) signaltransmitted by a user device in a wireless network, the computer programproduct comprising a non-transitory computer readable storage devicehaving computer readable program code stored therein, said program codecontaining instructions executable by one or more processors of acomputer system for: determining a plurality of subcarrier frequenciesallocated to the user device; converting the OFDM signal to a pluralityof frequency-domain values corresponding to the plurality of subcarrierfrequencies; and decoding the plurality of frequency-domain values torecover a plurality of data symbols encoded by the user device on theplurality of subcarrier frequencies; wherein decoding employs aplurality of codes that are inverse to, complex-conjugate of, orcomplementary to a set of complex-valued codes that the user deviceemploys to shape the OFDM signal into a superposition of cyclic-shiftedpulse waveforms that each has one of the plurality of data symbolsmodulated thereon.
 20. The computer program product of claim 19, whereineach of the plurality of codes employed for decoding comprises adifferent vector of linear phase offsets.
 21. The computer programproduct of claim 19, wherein the cyclic-shifted waveforms have cyclicshifts that cause the cyclic-shifted waveforms to be orthogonal, andeach of the plurality of codes employed for decoding comprises a set oflinear phase offsets that corresponds to one of the cyclic shifts. 22.The computer program product of claim 19, wherein the complex-valuedcodes cause the cyclic-shifted waveforms to be Sinc waveforms, and theplurality of codes is configured to decode the Sinc waveforms.
 23. Thecomputer program product of claim 19, wherein the plurality ofsubcarrier frequencies has a frequency spacing f_(s), and the pluralityof cyclic-shifted waveforms are periodic over a symbol intervalT_(s)=1/f_(s).
 24. The computer program product of claim 19, whereinconverting the OFDM signal to a plurality of frequency-domain valuesuses a discrete Fourier transform.
 25. The computer program product ofclaim 19, wherein the non-transitory computer-readable storage devicefurther includes instructions stored therein and executable by the oneor more processors for removing at least one of a guard interval, acyclic prefix, and a cyclic postfix from the OFDM signal beforeconverting the OFDM signal to the plurality of frequency-domain values.26. The computer program product of claim 19, wherein converting theOFDM signal to the plurality of frequency-domain values provides fororthogonal frequency division multiple access for the user device and atleast one other user device.
 27. The computer program product of claim19, wherein an m^(th) one of the plurality of codes is expressed as aset of N code chips for a set of integers n={0, . . . , N−1}, whereineach code chip is expressed by e^(i2πnm/N), wherein i is the square rootof −1, and π is Pi.